Journal article icon

Journal article

Ramsey numbers of cycles versus general graphs

Abstract:

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 number involving cycles: R(Cn, H) = (n−1)(χ(H)− 1) + σ(H), where σ(H) is the minimum possible size of a colour class in a χ(H)-colouring of H. Allen, Brightwell and Skokan conjectured that the sam...

Expand abstract
Publication status:
Accepted
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1017/fms.2023.6

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Role:
Author
ORCID:
0000-0002-9991-7120
Publisher:
Cambridge University Press
Journal:
Forum of Mathematics, Sigma More from this journal
Volume:
11
Article number:
E10
Publication date:
2023-02-17
Acceptance date:
2022-11-03
DOI:
EISSN:
2050-5094
Language:
English
Keywords:
Pubs id:
1311025
Local pid:
pubs:1311025
Deposit date:
2022-12-02

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP