Autor:	Vladimir Nikiforov, Cecil C. Rousseau
Rok vydání:	2005
Předmět:	Combinatorics Applied Mathematics General Mathematics Ramsey's theorem Stability result Computer Graphics and Computer-Aided Design Software Graph Mathematics
Zdroj:	Random Structures and Algorithms. 27:379-400
ISSN:	1098-2418 1042-9832
Popis:	A book Bp is a graph consisting of p triangles sharing a common edge. In this paper we prove that if p ≤ q/6 - o(q) and q is large, then the Ramsey number r (Bp, Bq) is given by r(Bp, Bq) = 2q + 3, and the constant 1/6 is essentially best possible. Our proof is based on Szemeredi's uniformity lemma and a stability result for books.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::4d8801fb8d35c58958d066a5093d131b https://doi.org/10.1002/rsa.20081 Zobrazit plný text záznamu Plný text