The Goldberg snark circular-flow-number conjecture
For every positive integer , let be the Goldberg snark on vertices, and let denote its circular flow number. The Goldberg snark circular-flow-number conjecture.
The paper verifies this equality for , , and , while proving the corresponding upper bound for every positive integer . Optimality of that upper bound remains open.
References
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).
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.