Stefán's circular-flow bound conjecture for class 1 odd-regular graphs
Let be a positive integer and let be a -regular class graph. Its circular flow number is denoted by .
Stefán's class 1 circular-flow bound conjecture.
The source presents this as a conjecture and, in the supplied text, does not state that it has been proved or disproved.
References
- 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.