Rainbow stackings of random edge-colorings

Noga Alon, Colin Defant, Noah Kravitz

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 (US)
Pages (from-to)1656-1670
Number of pages15
JournalBulletin of the London Mathematical Society
Volume57
Issue number6
DOIs
StatePublished - Jun 2025

All Science Journal Classification (ASJC) codes

  • General Mathematics

Fingerprint

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

Cite this