The Ramsey number for a triple of long even cycles
✍ Scribed by Agnieszka Figaj; Tomasz Łuczak
- Book ID
- 108167419
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 172 KB
- Volume
- 97
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
As usual, for simple graphs G and H, let the Ramsey number r(G,H) be defined as the least number n such that for any graph K of order n, either G is a subgraph of K or H is a subgraph of/(. We shall establish the values of r(aC~,bCs) and r(aCv, bC7) almost precisely (where nG is the graph consisting
For two given graphs G 1 and G 2 , the Ramsey number R(G 1 , G 2 ) is the smallest integer n such that for any graph G of order n, either G contains G 1 or the complement of G contains G 2 . Let C n denote a cycle of order n and W m a wheel of order m + 1. It is conjectured by Surahmat, E.T. Baskoro