Ramsey goodness of paths
Pokrovskiy, Alexey and Sudakov, B. (2017) Ramsey goodness of paths. Journal of Combinatorial Theory, Series B 122 , pp. 384-390. ISSN 0095-8956.
|
Text
1512.07874.pdf - Author's Accepted Manuscript Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (111kB) | Preview |
Abstract
Given a pair of graphs G and H, the Ramsey number R(G,H) is the smallest N such that every red-blue coloring of the edges of the complete graph KN contains a red copy of G or a blue copy of H. If graph G is connected, it is well known and easy to show that R(G,H)≥(|G|−1)(χ(H)−1)+σ(H), where χ(H) is the chromatic number of H and σ the size of the smallest color class in a χ(H)-coloring of H. A graph G is called H-good if R(G,H)=(|G|−1)(χ(H)−1)+σ(H). The notion of Ramsey goodness was introduced by Burr and Erdős in 1983 and has been extensively studied since then. In this short note we prove that n-vertex path Pn is H-good for all n≥4|H|. This proves in a strong form a conjecture of Allen, Brightwell, and Skokan.
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | Ramsey numbers, Ramsey goodness, Paths in graphs, Expanders |
| School: | Birkbeck Faculties and Schools > Faculty of Business and Law > Birkbeck Business School |
| Depositing User: | Alexey Pokrovskiy |
| Date Deposited: | 21 Jan 2019 11:15 |
| Last Modified: | 02 Aug 2023 17:47 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/25895 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |