Effective Bounds for Induced Size-Ramsey Numbers of Cycles
The induced size-Ramsey number r^indk(H) of a graph H is the smallest number of edges a (host) graph G can have such that for any k-coloring of its edges, there exists a monochromatic copy of H which is an induced subgraph of G. In 1995, in their seminal paper, Haxell, Kohayakawa and Łuczak showed t...
| Autori principali: | , , |
|---|---|
| Natura: | Journal article |
| Lingua: | English |
| Pubblicazione: |
Springer
2024
|