English

Intersecting 1-factors and nowhere-zero 5-flows

Combinatorics 2016-09-05 v1

Abstract

Let GG be a bridgeless cubic graph, and μ2(G)\mu_2(G) the minimum number kk such that two 1-factors of GG intersect in kk edges. A cyclically nn-edge-connected cubic graph GG has a nowhere-zero 5-flow if (1) n6n \geq 6 and μ2(G)2\mu_2(G) \leq 2 or (2) if n5μ2(G)3n \geq 5 \mu_2(G)-3

Keywords

Cite

@article{arxiv.1306.5645,
  title  = {Intersecting 1-factors and nowhere-zero 5-flows},
  author = {Eckhard Steffen},
  journal= {arXiv preprint arXiv:1306.5645},
  year   = {2016}
}

Comments

8 pages, 1 figure

R2 v1 2026-06-22T00:39:16.986Z