arXiv (All)
open access
Exact-palette rainbow embeddings in uniformly coloured pseudorandom graphs
We study the emergence of rainbow spanning configurations in independently and uniformly coloured sparse $(p,β)$-bijumbled graphs. If the palette of the colouring supports a surplus that is sublinear in the number of vertices, then asymptotically almost surely we obtain rainbow embeddings of perfect
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
- Random independent sets and local sparsity#927922
- Exact three-component covers in 2-coloured random bipartite graphs#1011301
- First-Passage Percolation on Spread-out line graphs: Microscopic Regime#821967
- Thinning and sprinkling: from robust sampling to almost Hamiltonicity#1078236
- $β$-Skewed Maximal Spanning Forests#999526
Record · ID 1104503
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