Circular flow number of Goldberg snarks

DOI10.1016/J.DISC.2023.113792zbMATH Open1530.05070arXiv2109.02921OpenAlexW3198273045MaRDI QIDQ6136676FDOQ6136676

R. Lukot'ka

Publication date: 17 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: A circular nowhere-zero $r$-flow on a bridgeless graph $G$ is an orientation of the edges and an assignment of real values from $[1,r-1]$ 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 $G$ is the infimum over all values $r$ such that $G$ admits a nowhere-zero $r$-flow. We prove that the circular glow number of Goldberg snark $G_{2k+1}$ is $4+1/(k+1)$, proving a conjecture of Goedgebeur, Mattiolo, and Mazzuoccolo.

Full work available at URL: https://arxiv.org/abs/2109.02921

zbMATH Keywords

snarkcircular flow numberGoldberg snarksbalanced valuation

Mathematics Subject Classification ID

Flows in graphs (05C21)

Cites Work

• A Contribution to the Theory of Chromatic Polynomials
• On (k,d)-colorings and fractional nowhere-zero flows
• Title not available (Why is that?)
• Circular flow numbers of regular multigraphs
• Snarks with given real flow numbers
• Balanced Valuations and Flows in Multigraphs
• Computational results and new bounds for the circular flow number of snarks
• Circular flow number of generalized Blanuša snarks
• Real flow number and the cycle rank of a graph
• Determining the circular flow number of a cubic graph

This page was built for publication: Circular flow number of Goldberg snarks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136676)