AbstractWe show that every graphGof size at least 256p2|G| contains a topological complete subgraph of orderp. This slight improvement of a recent result of Komlós and Szemerédi proves a conjecture made by Mader and by Erdös and Hajnal
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.