Buscar
Mostrando ítems 1-2 de 2
Artículo
The Size of a Graph Without Topological Complete Subgraphs
(2000)
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 ...
Artículo
Extremal Graphs without Topological Complete Subgraphs
(2004)
The exact values of the function $ex(n;TK_{p})$ are known for ${\lceil \frac{2n+5}{3}\rceil}\leq p < n$ (see [Cera, Diánez, and Márquez, SIAM J. Discrete Math., 13 (2000), pp. 295--301]), where $ex(n;TK_p)$ is the maximum ...