A new recoloring phase for a local greedy algorithm shows that random 5-regular graphs have bisection width below 0.496488n and, as a consequence, almost surely admit an internal partition.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Bisection width, max-cut and internal partitions of 5-regular graphs
A new recoloring phase for a local greedy algorithm shows that random 5-regular graphs have bisection width below 0.496488n and, as a consequence, almost surely admit an internal partition.