Jaeger–Linial–Payan–Tarsi conjecture on _3-connected graphs
Jaeger–Linial–Payan–Tarsi conjecture on _3-connected graphs
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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Miaomiao Han, Hong-Jian Lai and Jiaao Li, “Nowhere-zero 3-flow and Z_3-connectedness in Graphs with Four Edge-disjoint Spanning Trees”, arXiv:1610.04581 (2016).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.