On nowhere-zero 3-flows in Cayley graphs on groups of order p 2n
math.CO
Submitted: 2026-10-30
Updated: 2026-10-30
License: http://creativecommons.org/licenses/by/4.0/
The gist: We consider Tutte's 3-flow conjecture in the class of Cayley graphs on groups G of order p 2n, where p is a prime and n is square-free and coprime to p.
Terminology
Abstract
We consider Tutte's 3-flow conjecture in the class of Cayley graphs on groups G of order p 2n, where p is a prime and n is square-free and coprime to p. The conjecture has been proved by J. Zhang and Z. Zhang in the case where n is a prime (Discrete Mathematics, 2023); and by the authors in the case where p=2 (arXiv:2603.24175). In this paper, we prove the conjecture in the case where p > 2 and either a Sylow p-subgroup or a Hall n-subgroup of G is a cyclic group.
Sources
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality