Metraipolis › archive › dc_01a4312101ca

Exact-palette rainbow embeddings in uniformly coloured pseudorandom graphs — arXiv:2609.30304

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.30304
License (as archived)
CC0-1.0
Archived
2026-10-08T02:59:06.476Z
SHA-256 of the archived text
a41a23278c3e2a456843031b22ad4c24608af171f3178380159478a463cf68f2
Stable URL of this page
https://metraipolis.com/documento/dc_01a4312101ca

How to cite

Exact-palette rainbow embeddings in uniformly coloured pseudorandom graphs — arXiv:2609.30304 — arXiv (en), https://arxiv.org/abs/2609.30304 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_01a4312101ca (Metraipolis archive dc_01a4312101ca, sha256 a41a23278c3e2a456843031b22ad4c24608af171f3178380159478a463cf68f2)
BibTeX
@misc{dc01a4312101ca,
  title = {Exact-palette rainbow embeddings in uniformly coloured pseudorandom graphs — arXiv:2609.30304},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.30304},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_01a4312101ca; sha256 a41a23278c3e2a456843031b22ad4c24608af171f3178380159478a463cf68f2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30304. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study rainbow spanning configurations in bijumbled graphs whose edges are coloured independently and uniformly from a prescribed palette. For $n$-vertex $(p,\beta)$-bijumbled graphs with minimum degree at least a fixed positive multiple of $pn$, we obtain rainbow perfect matchings and Hamilton cycles with a sufficient palette surplus of order $(\log n)/p$, assuming $pn=\omega(\log n)$ and $\beta\le cpn$ for a sufficiently small constant $c$. For each prescribed spanning tree of fixed maximum degree $\Delta\ge2$, a surplus of order $L_{n,\Delta}(\log n)/p$ suffices under $\beta\le cpn/L_{n,\Delta}$, where $L_{n,\Delta}=\Delta^{5\sqrt{\log n}}$. The palette surplus is sublinear under these hypotheses. These results use a McDiarmid-type coupling and retain the discrepancy scales of the relevant deterministic embedding theorems. We also prove exact-palette results, using precisely as many colours as the number of edges of the target configuration. After independent edge percolation at rate $\rho$, it is shown that a rainbow perfect matching or Hamilton cycle exists asymptotically almost surely when $\rho pn \ge C(\log n)^2$ and $\beta\le\gamma pn$ for appropriate constants $C$ and $\gamma$. We obtain corresponding results for each prescribed bounded-degree spanning tree and for clique factors under appropriate stronger hypotheses. The exact-palette proofs construct spread measures from uncoloured containment estimates and apply the rainbow threshold theorem of Han and Yuan.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-28 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.30304 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T02:28:17.896Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).