Bhargav Narayanan - Rutgers University
Date/Time/Location
Tuesday, September 22nd, 12:00pm; Hill Center 705
"Friendly Bisections of Random Graphs"
We prove that with high probability, the random graph G(n,1/2) on an even number of vertices admits a partition of its vertex set into two parts of equal size in which n ? o(n) vertices have more neighbours on their own side than across. This settles an old conjecture of Furedi from 1988, which also appears as Problem 91 in Ben Green’s list of 100 open problems.