Jaeger–Linial–Payan–Tarsi conjecture on _3-connected graphs

From papers

Let GG be a finite graph without loops, possibly with multiple edges. A graph is Z3\mathbb{Z}_3-connected if, for every zero-sum function β:V(G)Z3\beta:V(G)\to\mathbb{Z}_3, there is an orientation DD such that

dD+(v)dD(v)=β(v)(mod3)d_D^+(v)-d_D^-(v)=\beta(v)\pmod 3

for every vertex vV(G)v\in V(G). Jaeger, Linial, Payan and Tarsi's conjecture. Every 55-edge-connected graph is Z3\mathbb{Z}_3-connected. This generalizes the relationship between nowhere-zero flows and modulo orientations; it remains open, while every 66-edge-connected graph is known to be Z3\mathbb{Z}_3-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

No solutions have been posted yet.