Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
It is shown that each graph \(G\) of size \(\geq 256p^2| G| \) contains a topological complete subgraph of order \(p\). This proves a conjecture made by W. Mader and by P. Erdős and A. Hajnal.
scientific article; zbMATH DE number 1248162