Jaeger–Linial–Payan–Tarsi conjecture on _3-connected graphs
Statement
Let be a finite graph without loops, possibly with multiple edges. A graph is -connected if, for every zero-sum function , there is an orientation such that
for every vertex . Jaeger, Linial, Payan and Tarsi's conjecture. Every -edge-connected graph is -connected. This generalizes the relationship between nowhere-zero flows and modulo orientations; it remains open, while every -edge-connected graph is known to be -connected.
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.