Jaeger orientations in random regular graphs
Jaeger orientations in random regular graphs
Let be the uniform model of random -regular graphs on the vertex set . A -orientation is an orientation of a -regular graph in which every vertex has in-degree or out-degree . An event holds asymptotically almost surely (a.a.s.) if its probability tends to as . Jaeger-orientation conjecture. For every fixed , a.a.s. the random graph has a Jaeger orientation.
This extends the known a.a.s. results for , , and all sufficiently large . The conjecture concerns the typical existence of these orientations even though the deterministic Jaeger conjecture is false for .
Sources & referencesView supporting material
Primary source
Catherine Greenhill, Mikhail Isaev and Charles Lewis, “Jaeger-type orientations of random regular graphs”, arXiv:2604.22219 (2026).
Additional references
26 papers in this index state this conjecture (2007–2026). The statement above is taken from the most recent of them; the others are arXiv:2509.14184, arXiv:2503.19411, arXiv:2410.01049, arXiv:2401.05510, arXiv:2309.04450, arXiv:2306.13340, arXiv:2305.05981, arXiv:2210.12103, arXiv:2110.13684, arXiv:2104.09241, arXiv:2101.04768, arXiv:1911.06759, and 13 more.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.