New exact values of the maximum size of graphs free of topological complete subgraphs
The extremal number ex(n; TKp) denotes the maximum number of edges of a graph of order n containing no topological complete graph TKp as a subgraph. In this paper we give the exact value of the extremal number ex(n; TKp) for (7n+7)/12 p< (2n+ 1)/3 provided that n − p 15. Furthermore, we find the...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2007 |
| 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/163705 |
| Acceso en línea: | https://hdl.handle.net/11441/163705 https://doi.org/10.1016/j.disc.2006.07.031 |
| Access Level: | acceso abierto |
| Palabra clave: | Extremal graphs Topological complete subgraph |
| Sumario: | The extremal number ex(n; TKp) denotes the maximum number of edges of a graph of order n containing no topological complete graph TKp as a subgraph. In this paper we give the exact value of the extremal number ex(n; TKp) for (7n+7)/12 p< (2n+ 1)/3 provided that n − p 15. Furthermore, we find the corresponding extremal graphs for n − p 17. |
|---|