Odd-ordered Cayley graphs satisfy Erd s--Gy'arf'as
math.CO, math.GR
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Erd\H{o}s-Gy'arf'as conjecture on graphs without long induced paths
- A 60-Vertex Lower Bound for Cubic Bipartite Counterexamples to the Erd\H{o}s-Gy'arf'as Conjecture
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