Ramsey numbers of cycles versus general graphs
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a copy of F or its complement contains H. Burr in 1981 proved a pleasingly general result that for any graph H, provided n is sufficiently large, a natural lower bound construction gives the correct Ramsey...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Cambridge University Press
2023
|