2016-02-042016-02-042000http://hdl.handle.net/11441/34058In 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.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/extremal graph theorytopological complete subgraphsinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttp://dx.doi.org/10.1137/S0895480197315941https://idus.us.es/xmlui/handle/11441/34058