2024-10-182024-10-182001Cera López, M., Diánez Martínez, A.R. y Vázquez, P.G. (2001). Structure of the extremal family ex(n; TKp). Electronic Notes In Discrete Mathematics, 10, 72-74. https://doi.org/10.1016/S1571-0653(04)00361-0.1571-0653https://hdl.handle.net/11441/163828Given a positive integer p a graph G is said to contain an homeomorphic subgraph to the complete graph of order p and it is denoted by G TK p if it is possible to nd p vertices fv vpg and p pairwaise vertex disjoint paths joining these vertices in G The study of the existence of complete homeomorphic subgraphs of order p in a graph of order n follows to the extremal problem consisting of determining the maximum number of edges ex n TK p of a graph not containing to TK papplication/pdf3 p.engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccess10.1016/S1571-0653(04)00361-0