Jaeger et al.'s group-connectivity analogue of the 3-flow conjecture
Jaeger et al.'s group-connectivity analogue of the 3-flow conjecture
For an abelian group , a graph is -connected if has a nowhere-zero flow for every -boundary . Jaeger et al.'s group-connectivity conjecture. Every -edge-connected graph is -connected.
This is a group-connectivity analogue of the 3-flow conjecture. The source reports that the conjecture is known for planar and projective-planar graphs, so the general case is resolved according to the supplied status evidence.
Sources & referencesView supporting material
Primary source
Zdeněk Dvořák and Bojan Mohar, “On density of Z_3-flow-critical graphs”, arXiv:2205.07498 (2022).
Additional references
5 papers in this index state this conjecture (2014–2022). The statement above is taken from the most recent of them; the others are arXiv:2011.00672, arXiv:2011.02140, arXiv:1610.01113, arXiv:1411.6401.
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.