2024-10-162024-10-162007Balbuena, C., Cera López, M., Diánez Martínez, A.R. y García Vázquez, P. (2007). New exact values of the maximum size of graphs free of topological complete subgraphs. Discrete Mathematics, 307 (9-10), 1038-1046. https://doi.org/10.1016/j.disc.2006.07.031.0012-365X1872-681Xhttps://hdl.handle.net/11441/163705The 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.application/pdf9 p.engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Extremal graphsTopological complete subgraphinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccess10.1016/j.disc.2006.07.031