Circular flow number of Goldberg snarks
Combinatorics
2021-09-08 v1
Abstract
A circular nowhere-zero -flow on a bridgeless graph is an orientation of the edges and an assignment of real values from to the edges in such a way that the sum of incoming values equals the sum of outgoing values for every vertex. The circular flow number of is the infimum over all values such that admits a nowhere-zero -flow. We prove that the circular glow number of Goldberg snark is , proving a conjecture of Goedgebeur, Mattiolo, and Mazzuoccolo.
Cite
@article{arxiv.2109.02921,
title = {Circular flow number of Goldberg snarks},
author = {Robert Lukoťka},
journal= {arXiv preprint arXiv:2109.02921},
year = {2021}
}