The Goldberg snark circular-flow-number conjecture

From papers

For every positive integer kk, let G2k+1G_{2k+1} be the Goldberg snark on 8(2k+1)8(2k+1) vertices, and let Φc(G2k+1)\Phi_c(G_{2k+1}) denote its circular flow number. The Goldberg snark circular-flow-number conjecture.

Φc(G2k+1)=4+1k+1.\Phi_c(G_{2k+1})=4+\frac{1}{k+1}.

The paper verifies this equality for G3G_3, G5G_5, and G7G_7, while proving the corresponding upper bound for every positive integer kk. Optimality of that upper bound remains open.

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

Jan Goedgebeur, Davide Mattiolo and Giuseppe Mazzuoccolo, “An algorithm and new bounds for the circular flow number of snarks”, arXiv:1909.09870 (2019).

Solutions 0

No solutions have been posted yet.