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 language | English (US) |
|---|---|
| Pages (from-to) | 1656-1670 |
| Number of pages | 15 |
| Journal | Bulletin of the London Mathematical Society |
| Volume | 57 |
| Issue number | 6 |
| DOIs | |
| State | Published - Jun 2025 |
All Science Journal Classification (ASJC) codes
- General Mathematics