Rainbow stackings of random edge-colorings

Noga Alon, Colin Defant, Noah Kravitz*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

A rainbow stacking of (Formula presented.) -edge-colorings (Formula presented.) of the complete graph on (Formula presented.) vertices is a way of superimposing (Formula presented.) so that no edges of the same color are superimposed on each other. We determine a sharp threshold for (Formula presented.) (as a function of (Formula presented.) and (Formula presented.)) governing the existence and nonexistence of rainbow stackings of random (Formula presented.) -edge-colorings (Formula presented.).

Original languageEnglish
JournalBulletin of the London Mathematical Society
DOIs
StateAccepted/In press - 2025

Funding

FundersFunder number
National Science Foundation2201907, DMS‐2154082
Harvard UniversityDGE–203965

    Fingerprint

    Dive into the research topics of 'Rainbow stackings of random edge-colorings'. Together they form a unique fingerprint.

    Cite this