The Ramsey number r(K5 - P3,K5)
For two given graphs G1 and G2, the Ramsey number r(G1,G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the comple ment of G contains G2. Let Km denote a complete graph of order m and Kn − P3 a complete graph of order n without two incident edges. In this p...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2011 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/163877 |
| Acceso en línea: | https://hdl.handle.net/11441/163877 https://doi.org/10.37236/577 |
| Access Level: | acceso abierto |
| Sumario: | For two given graphs G1 and G2, the Ramsey number r(G1,G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the comple ment of G contains G2. Let Km denote a complete graph of order m and Kn − P3 a complete graph of order n without two incident edges. In this paper, we prove that r(K5 − P3,K5) = 25 without help of computer algorithms. |
|---|