Extendability conjecture for 5-edge-connected essentially 6-edge-connected graphs
Extendability conjecture for 5-edge-connected essentially 6-edge-connected graphs
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.
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).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.