Large generalized books are p-good
Combinatorics
2007-05-23 v1
Abstract
An r-book of size q is a union of q (r+1)-cliques sharing a common r-clique. We find exactly the Ramsey number of a p-clique versus r-books of sufficiently large size. Furthermore, we find asymptotically the Ramsey number of any fixed p-chromatic graph versus r-books of sufficiently large size. The key element in our proofs is Szemeredi's Regularity Lemma.
Keywords
Cite
@article{arxiv.math/0405140,
title = {Large generalized books are p-good},
author = {Vladimir Nikiforov and Cecil Rousseau},
journal= {arXiv preprint arXiv:math/0405140},
year = {2007}
}
Comments
16 pages, accepted in JCTB