Seminar with Prof. Greg Sorkin: Extremal Cuts and Isoperimetry in Random Cubic Graphs
Huxley 217The minimum bisection width of random cubic graphs is of interest because it is one of the simplest questions imaginable in extremal combinatorics, and also because the minimum bisection of... Read more »