Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Bates, Blake"'
Autor:
Bates, Blake, Berikkyzy, Zhanar, Chiem, Nick, Elvin, Gabriel, Fines, Risa, Lie, Maja, Mikulás, Hanna, Reiter, Isaac, Zhou, Kevin
We say a graph $H$ is $r$-rainbow-uncommon if the maximum number of rainbow copies of $H$ under an $r$-coloring of $E(K_n)$ is asymptotically (as $n \to \infty$) greater than what is expected from uniformly random $r$-colorings. Via explicit construc
Externí odkaz:
http://arxiv.org/abs/2403.04055
