Planar Circular Flow Conjecture
Let be a positive integer, and let be a planar graph. A circular -flow of is a flow such that every edge satisfies
Planar Circular Flow Conjecture. Every -edge-connected planar graph admits a circular -flow.
This conjecture is motivated by Jaeger's conjecture that every -edge-connected graph admits a circular -flow, which was disproved for all by Han, Li, Wu, and Zhang. The cited counterexamples are nonplanar, so the planar case remains the relevant unresolved question.
References
- Daniel W. Cranston, Jiaao Li, Bo Su, Zhouningxin Wang and Chunyan Wei, “Orientations of 10-Edge-Connected Planar Multigraphs and Applications”, arXiv:2603.24292 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.