Article
The Size of a Graph Without Topological Complete Subgraphs
Author/s | Cera López, Martín
Diánez Martínez, Ana Rosa Márquez Pérez, Alberto |
Department | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Publication Date | 2000 |
Deposit Date | 2016-02-04 |
Published in |
|
Abstract | 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. |
Files | Size | Format | View | Description |
---|---|---|---|---|
The size of a graph.pdf | 123.5Kb | [PDF] | View/ | |