Bisection width, max-cut and internal partitions of 5-regular graphs
Endre Csóka, Panna Tímea Fekete, Zoltán Lóránt Nagy, Levente Szemerédi
Published: 2025/9/10
Abstract
In this paper, we present a new factor of IID process based on the local algorithm introduced by D\'iaz, Serna, and Wormald (2007). This new approach allows us to improve the previously known upper bounds on the minimum and maximum bisection width and the maximum cut of random d-regular graphs for d > 4 by introducing a new recoloring phase after the termination of the original algorithm. As an application, we show that random 5-regular graphs asymptotically almost surely admit an internal partition, i.e., a partition of the vertex set into two nonempty classes so that every vertex has at least half of its neighbors in its own class.