
arXiv: 2405.14795
AbstractA 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 .
Coloring of graphs and hypergraphs, Random graphs (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05C15, 05C80
Coloring of graphs and hypergraphs, Random graphs (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05C15, 05C80
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
