On graphs without cycles of length 0 modulo 3 or 4 modulo 6
math.CO
Submitted: 2026-08-07
Updated: 2026-10-26
Comments: 20 pages, 6 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- On 2-connected graphs without cycles of length 1 modulo 3
- On graphs without cycles of length 1 modulo 3
- On $2$-connected graphs avoiding cycles of length $0$ modulo $4$
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