Extendability conjecture for 5-edge-connected essentially 6-edge-connected graphs
Statement
Let be a graph and let . A graph is -extendable at if every pre-orientation of the edges incident with whose out-degree minus in-degree at agrees modulo with a prescribed zero-sum function can be extended to the corresponding -orientation of . Extendability conjecture. Every -edge-connected essentially -edge-connected graph is -extendable at any vertex of degree . This is presented as a strengthening of the Jaeger–Linial–Payan–Tarsi conjecture, and the paper states that it would imply that conjecture; its resolution is not supplied here.
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.