arXiv (All)
open access
Explicit and logarithmically improved chromatic bounds for $(P_2\cup P_3)$-free graphs
We prove that every \((P_2\cup P_3)\)-free graph \(G\), with \(k=ω(G)\), satisfies \[ χ(G)=O\!\left(k^3\frac{\ln\ln k}{\ln k}\right). \] Thus the class admits an \(o(k^3)\) binding function. We also prove the explicit bound \[ χ(G)\le \frac{k^3}{8}+\frac{5k^2}{4}-4k+8 \qquad(k\ge8), \] with a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A disproof of a gap-one conjecture for the equitable chromatic number of block graphs#609675
- Improved upper bounds on the list chromatic number of $K_t$-minor-free graphs#1157217
- Beyond halfway to Hadwiger's conjecture#987876
- k-Coloring is Faster than Computing the Chromatic Number#987763
- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number#1036284
Record · ID 987759
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive