Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Chiem, Nick"'
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
Publikováno v:
Journal of Combinatorics Vol. 15, No. 3 (2024), 361-382
Steinerberger defined a notion of boundary for a graph and established a corresponding isoperimetric inquality. Hence, "large" graphs have more boundary vertices. In this paper, we first characterize graphs with three boundary vertices in terms of tw
Externí odkaz:
http://arxiv.org/abs/2209.04438