Jaeger orientations in random regular graphs
Statement
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 .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.