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...
Main Authors: | Bradač, D, Draganić, N, Sudakov, B |
---|---|
Format: | Journal article |
Sprog: | English |
Udgivet: |
Springer
2024
|
Lignende værker
-
Ordered Ramsey numbers
af: Conlon, D, et al.
Udgivet: (2016) -
Ramsey numbers of cubes versus cliques
af: Conlon, David, et al.
Udgivet: (2015) -
The Erdős-Gyárfás problem on generalized Ramsey numbers
af: Conlon, D, et al.
Udgivet: (2014) -
A note on induced Ramsey numbers
af: Conlon, D, et al.
Udgivet: (2017) -
Ramsey numbers of cycles versus general graphs
af: Haslegrave, J, et al.
Udgivet: (2023)