Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Herrman, Tyler"'
For a graph with colored vertices, a rainbow subgraph is one where all vertices have different colors. For graph $G$, let $c_k(G)$ denote the maximum number of different colors in a coloring without a rainbow path on $k$ vertices, and $cp_k(G)$ the m
Externí odkaz:
http://arxiv.org/abs/2501.01302
