Metraipolis › archive › dc_41544af77b07

Circular flows and bisections of random regular graphs — arXiv:2611.03763

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03763
License (as archived)
CC0-1.0
Archived
2026-11-04T19:00:00.262Z
SHA-256 of the archived text
975531a8d5bdc1993f3eba6c562b1fb3348fabf1273172083813da2b3f7458b2
Stable URL of this page
https://metraipolis.com/documento/dc_41544af77b07

How to cite

Circular flows and bisections of random regular graphs — arXiv:2611.03763 — arXiv (en), https://arxiv.org/abs/2611.03763 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_41544af77b07 (Metraipolis archive dc_41544af77b07, sha256 975531a8d5bdc1993f3eba6c562b1fb3348fabf1273172083813da2b3f7458b2)
BibTeX
@misc{dc41544af77b07,
  title = {Circular flows and bisections of random regular graphs — arXiv:2611.03763},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03763},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_41544af77b07; sha256 975531a8d5bdc1993f3eba6c562b1fb3348fabf1273172083813da2b3f7458b2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03763. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Jaeger conjectured that, for every positive integer $p$, every $4p$-edge-connected graph admits an orientation with congruent indegree and outdegree modulo $2p+1$. We prove a stronger probabilistic counterpart: a uniformly random simple $(4p+1)$-regular graph has a strongly connected orientation with all outdegrees in $\{p,3p+1\}$ with probability tending to one as its even order grows. More generally, for every fixed odd $d\ge9$, there is $\varepsilon_d>0$ such that its circular flow number is less than $2+4/(d-1)-\varepsilon_d$ with probability tending to one. We give explicit margins at the small degrees and prove the bound $91/33$ at degree seven, answering a fixed-upper-bound question of Li and Li. Gaps below $3$ at degree five and below $8/3$ at degree seven remain open. A uniform estimate for dense bisections also gives short intervals above the Li--Li maximum-bisection lower bound. Finally, we prove the one-unit bisection-gap conjecture of Greenhill, Isaev and Lewis: at every fixed degree $d\ge3$, the typical minimum parameter for orientations with outdegrees in $\{p,d-p\}$ exceeds the threshold forced by the maximum bisection by at most one.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.03763 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:37:52.336Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).