A conjecture on the maximum cut and bisection width in random regular graphs

作者：Zdeborova Lenka^*; Boettcher Stefan

来源：Journal of Statistical Mechanics: Theory and Experiment , 2010, P02020.

DOI：10.1088/1742-5468/2010/02/P02020

• cavity and replica method
• spin glasses (theory)
• random graphs
• networks

The asymptotic properties of random regular graphs are objects of extensive study in mathematics and physics. In this paper we argue, using the theory of spin glasses in physics, that in random regular graphs the maximum cut size asymptotically equals the number of edges in the graph minus the minimum bisection size. Maximum cut and minimal bisection are two famous NP-complete problems with no known general relation between them; hence our conjecture is a surprising property for random regular graphs. We further support the conjecture with numerical simulations. A rigorous proof of this relation is an obvious challenge.

• 出版日期2010-2