Jaeger orientations in random regular graphs

Let Gn,d\mathcal{G}_{n,d} be the uniform model of random dd-regular graphs on the vertex set [n]={1,2,,n}[n]=\{1,2,\ldots,n\}. A pp-orientation is an orientation of a dd-regular graph in which every vertex has in-degree pp or out-degree pp. An event holds asymptotically almost surely (a.a.s.) if its probability tends to 11 as nn\to\infty. Jaeger-orientation conjecture. For every fixed p1p\geq 1, a.a.s. the random graph Gn,4p+1\mathcal{G}_{n,4p+1} has a Jaeger orientation.

This extends the known a.a.s. results for p=1p=1, p=2p=2, and all sufficiently large pp. The conjecture concerns the typical existence of these orientations even though the deterministic Jaeger conjecture is false for p3p\geq3.

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.