Artículo
The Size of a Graph Without Topological Complete Subgraphs
Autor/es | Cera López, Martín
Diánez Martínez, Ana Rosa Márquez Pérez, Alberto |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2000 |
Fecha de depósito | 2016-02-04 |
Publicado en |
|
Resumen | 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 ... 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
The size of a graph.pdf | 123.5Kb | [PDF] | Ver/ | |