3-flows with large support

DOI10.1016/J.JCTB.2019.12.006MaRDI QIDQ777476zbMATH OpenOpenAlexFDO

Authors Matt DeVos, Jessica McDonald, Irene Pivotto, Edita Rollová, Robert Šámal

Publication date 7 July 2020

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

nowhere-zero flowsflows on graphsTutte 3-flow problem

Mathematics Subject Classification ID

Flows in graphs (05C21)

Abstract: We prove that every 3-edge-connected graph $G$ has a 3-flow $phi$ with the property that $|mathopsupp(phi)|gefrac56|E(G)|$. The graph $K_4$ demonstrates that this $frac56$ ratio is best possible; there is an infinite family where $frac56$ is tight.

Recommendations

• 3-flows and combs
• A note on nowhere-zero 3-flows and \(Z_3\)-connectivity
• Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs
• Flows in 3-edge-connected bidirected graphs
• Nowhere-zero 3-flows and modulo \(k\)-orientations

Cites work

• scientific article; zbMATH DE number 5130820 (Why is no real title available?)
• A Class Of Abelian Groups
• A Contribution to the Theory of Chromatic Polynomials
• A Reduction Method for Edge-Connectivity in Graphs
• Flows and generalized coloring theorems in graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere-zero 6-flows
• On the algebraic theory of graph colorings

Cited in

(2)

• 3-flows and combs
• Snarks with resistance \(n\) and flow resistance \(2n\)

This page was built for publication: 3-flows with large support

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