Stefán's circular-flow bound conjecture for class 1 odd-regular graphs

From papers

Let tt be a positive integer and let GG be a (2t+1)(2t+1)-regular class 11 graph. Its circular flow number is denoted by ϕc(G)\phi_c(G).

Stefán's class 1 circular-flow bound conjecture.

ϕc(G)2+2t.\phi_c(G)\le 2+\frac{2}{t}.

The source presents this as a conjecture and, in the supplied text, does not state that it has been proved or disproved.

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

No solutions have been posted yet.