The Size of a Graph Without Topological Complete Subgraphs

In this note we show a new upperbound for the function ex(n;TKp), i.e., the maximum number of edges of a graph of order n not containing a subgraph homeomorphic to the complete graph of order p. Further, for ${\left \lceil \frac{2n+5}{3}\right \rceil}\leq p < n$ we provide exact values for this f...

Descripción completa

Detalles Bibliográficos
Autores: Cera López, Martín, Diánez Martínez, Ana Rosa, Márquez Pérez, Alberto
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2000
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/34058
Acceso en línea:http://hdl.handle.net/11441/34058
https://doi.org/10.1137/S0895480197315941
Access Level:acceso abierto
Palabra clave:extremal graph theory
topological complete subgraphs
id ES_2caee565b2a3d3d3cd4abe8671351591
oai_identifier_str oai:idus.us.es:11441/34058
network_acronym_str ES
network_name_str España
repository_id_str
spelling The Size of a Graph Without Topological Complete SubgraphsCera López, MartínDiánez Martínez, Ana RosaMárquez Pérez, Albertoextremal graph theorytopological complete subgraphsIn this note we show a new upperbound for the function ex(n;TKp), i.e., the maximum number of edges of a graph of order n not containing a subgraph homeomorphic to the complete graph of order p. Further, for ${\left \lceil \frac{2n+5}{3}\right \rceil}\leq p < n$ we provide exact values for this function.Matemática Aplicada I2000info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttp://hdl.handle.net/11441/34058https://doi.org/10.1137/S0895480197315941reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésSIAM J. Discrete Math., 13(3), 295–301 (2000)info:eu-repo/semantics/openAccessoai:idus.us.es:11441/340582026-06-17T12:51:07Z
dc.title.none.fl_str_mv The Size of a Graph Without Topological Complete Subgraphs
title The Size of a Graph Without Topological Complete Subgraphs
spellingShingle The Size of a Graph Without Topological Complete Subgraphs
Cera López, Martín
extremal graph theory
topological complete subgraphs
title_short The Size of a Graph Without Topological Complete Subgraphs
title_full The Size of a Graph Without Topological Complete Subgraphs
title_fullStr The Size of a Graph Without Topological Complete Subgraphs
title_full_unstemmed The Size of a Graph Without Topological Complete Subgraphs
title_sort The Size of a Graph Without Topological Complete Subgraphs
dc.creator.none.fl_str_mv Cera López, Martín
Diánez Martínez, Ana Rosa
Márquez Pérez, Alberto
author Cera López, Martín
author_facet Cera López, Martín
Diánez Martínez, Ana Rosa
Márquez Pérez, Alberto
author_role author
author2 Diánez Martínez, Ana Rosa
Márquez Pérez, Alberto
author2_role author
author
dc.contributor.none.fl_str_mv Matemática Aplicada I
dc.subject.none.fl_str_mv extremal graph theory
topological complete subgraphs
topic extremal graph theory
topological complete subgraphs
description In this note we show a new upperbound for the function ex(n;TKp), i.e., the maximum number of edges of a graph of order n not containing a subgraph homeomorphic to the complete graph of order p. Further, for ${\left \lceil \frac{2n+5}{3}\right \rceil}\leq p < n$ we provide exact values for this function.
publishDate 2000
dc.date.none.fl_str_mv 2000
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11441/34058
https://doi.org/10.1137/S0895480197315941
url http://hdl.handle.net/11441/34058
https://doi.org/10.1137/S0895480197315941
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv SIAM J. Discrete Math., 13(3), 295–301 (2000)
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.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_ 1869405258071932928
score 15,300724

Similares en LA Referencia