The conjecture that every 3-edge-connected graph has Frank number at most 3
Let be a -edge-connected graph. Its Frank number is the minimum number of orientations needed so that every edge is deletable in at least one of them. Frank-number conjecture. Every -edge-connected graph satisfies
The paper proves the general upper bound , obtains for the Petersen graph, and gives improved bounds for more restricted graph classes. Improving the general bound to remains open.
References
- Florian Hörsch and Zoltán Szigeti, “Connectivity of orientations of 3-edge-connected graphs”, arXiv:2012.03259 (2020).
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.