Matthew Kwan "Friendly bisections of random graphs" | Big Seminar

It is our pleasure to share the Big Seminar talk "Friendly bisections of random graphs" by Matthew Kwan.

Abstract:
Resolving a conjecture of Füredi, we prove that almost every n-vertex graph admits a partition of its vertex set into two parts of equal size in which almost all vertices have more neighbours on their own side than across. Our proof involves some new techniques for studying processes driven by degree information in random graphs, which may be of general interest.

Seminars schedule and archive are available here - http://combgeo.org/en/events/big-seminar.