arXiv (All)
open access
Resilience of rainbow Hamilton cycles in pseudorandom graphs
For every fixed $\varepsilon\in(0,1/2)$, we prove that every spanning subgraph $H$ of an $n$-vertex $(p,β)$-bijumbled graph satisfying $δ(H)\geq(1/2+\varepsilon)pn$ contains a rainbow Hamilton cycle under every globally $μpn$-bounded colouring, provided $β\leq cpn$ and $pn\geq M$ both hold. The same
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 Proof of Füredi's Conjecture#999431
- Confirmation of the Daykin-Frankl Conjecture#925452
- Confirmation of the Daykin-Frankl Conjecture#921216
- Spectrum of Johnson graphs#985298
- New Bounds for Proper h‐Conflict‐Free Colorings#147478
Record · ID 1062542
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