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...

Descripción completa

Detalles Bibliográficos
Autor: Boza Prieto, Luis
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
id ES_b2bce5a6bbe78deb9487f6e8c4e2826c
oai_identifier_str oai:idus.us.es:11441/163877
network_acronym_str ES
network_name_str España
repository_id_str
spelling The Ramsey number r(K5 - P3,K5)Boza Prieto, LuisFor 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.Electronic Journal of CombinatoricsMatemática Aplicada I2011info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/163877https://doi.org/10.37236/577reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésElectronic Journal of Combinatorics, 185 (1).https://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i1p90info:eu-repo/semantics/openAccessoai:idus.us.es:11441/1638772026-06-17T12:51:07Z
dc.title.none.fl_str_mv The Ramsey number r(K5 - P3,K5)
title The Ramsey number r(K5 - P3,K5)
spellingShingle The Ramsey number r(K5 - P3,K5)
Boza Prieto, Luis
title_short The Ramsey number r(K5 - P3,K5)
title_full The Ramsey number r(K5 - P3,K5)
title_fullStr The Ramsey number r(K5 - P3,K5)
title_full_unstemmed The Ramsey number r(K5 - P3,K5)
title_sort The Ramsey number r(K5 - P3,K5)
dc.creator.none.fl_str_mv Boza Prieto, Luis
author Boza Prieto, Luis
author_facet Boza Prieto, Luis
author_role author
dc.contributor.none.fl_str_mv Matemática Aplicada I
description 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.
publishDate 2011
dc.date.none.fl_str_mv 2011
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/163877
https://doi.org/10.37236/577
url https://hdl.handle.net/11441/163877
https://doi.org/10.37236/577
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Electronic Journal of Combinatorics, 185 (1).
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i1p90
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Electronic Journal of Combinatorics
publisher.none.fl_str_mv Electronic Journal of Combinatorics
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869417080373116928
score 15,812429

Similares en LA Referencia