Rainbow stackings of random edge‐colorings
Abstract A rainbow stacking of ‐edge‐colorings of the complete graph on vertices is a way of superimposing so that no edges of the same color are superimposed on each other. We determine a sharp threshold for (as a function of and ) governing the existence and nonexistence of rainbow stackings of random ‐edge‐colorings .
Authors
- Colin Defant (ORCID: https://orcid.org/0000-0002-4910-5765)
- Noah Kravitz
- Noga Alon (ORCID: https://orcid.org/0000-0003-1332-4883)
Institutions
- Tel Aviv University (IL)
- Princeton University (US)
- Harvard University Press (US)
Publication Details
- Journal
- Bulletin of the London Mathematical Society
- Published
- 2025-03-13
- DOI
- https://doi.org/10.1112/blms.70052
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- Harvard University