Stefán's circular-flow infimum conjecture for odd-regular class 2 graphs
Stefán's circular-flow infimum conjecture for odd-regular class 2 graphs
From papers
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.
The source explicitly states that this conjecture is proved in the paper, so the claim is resolved.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Davide Mattiolo and Eckhard Steffen, “Edge colorings and circular flows on regular graphs”, arXiv:2001.02484 (2020).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.