Paperlane

no. 9 · Thursday 5 November 2026

On the minimum bisection of random $3$-regular graphs

Lyuben Lichev and Dieter Mitsche

math.PR · v4

Abstract

In this paper we give new bounds on the bisection width of random 3-regular graphs on $n$ vertices. The main contribution is a new lower bound of $0.103295n$ based on a first moment method together with a structural analysis of the graph, thereby improving a 27-year-old result of Kostochka and Melnikov. We also give a complementary upper bound of $0.139822n$ by combining a result of Lyons with original combinatorial insights. Developping this approach further, we obtain a non-rigorous improved upper bound with the help of Monte Carlo simulations.

comments
Minor numeric changes with respect to the previous version
fields
Probability, Combinatorics
pdf ↗ page arXiv:2009.00598 ↗