Stefán's circular-flow infimum conjecture for odd-regular class 2 graphs
Let be a positive integer, and let denote the infimum of over all -regular class graphs , where is the circular flow number.
Stefán's circular-flow infimum conjecture.
References
Status
- Solved: Davide Mattiolo and Eckhard Steffen. Edge colorings and circular flows on regular graphs (Journal of Graph Theory, 2022) https://doi.org/10.1002/jgt.22746
Source: Davide Mattiolo and Eckhard Steffen, “Edge colorings and circular flows on regular graphs”, arXiv:2001.02484 (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.