arXiv (All)
open access
Sparse Approximate Chromatic Profiles of Triangle-Free Graphs
We prove a sparse version of the four-colour theorem of Brandt and Thomassé, answering a question of Allen, Böttcher, Kohayakawa and Roberts. For every fixed $0<γ\le1/10$ and every $p=p(n)\in(0,1]$, asymptotically almost surely every spanning triangle-free $H\subseteq G(n,p)$ with $δ(H)\ge(1/3+γ)pn$
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
- Variance of random greedy independent sets in triangle-free graphs#1084744
- Shape Theorem for the Contact Process in a Dynamical Random Environment#1129104
- A General Upper Bound on Multicolor Ordered Ramsey Numbers#1064619
- A combinatorial approach to point-flat incidences over finite fields#1118077
- Trace-defect bounds for discrete Fourier concentration operators#1000189
Record · ID 1063363
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