Explicit and logarithmically improved chromatic bounds for (P 2 P 3) -free graphs
math.CO
Submitted: 2026-07-26
Updated: 2026-10-29
Comments: 16 pages. Proofs simplified and exposition revised. Main results unchanged. The earlier row estimates and the quadratic bound under a rank-gap condition are not reproduced here; see v3 for those results
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
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