Journal ArticleOPEN ACCESS

Proof of a conjecture of Mader, Erdös and Hajnal on topological complete subgraphs

European Journal of Combinatorics (1998) 19(8) 883-887
DOI: 10.1006/eujc.1997.0188
103Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show that every graph G of size at least 256p2|G| contains a topological complete subgraph of order p. 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. © 1998 Academic Press.

Cite

CITATION STYLE

APA

Bollobás, B., & Thomason, A. (1998). Proof of a conjecture of Mader, Erdös and Hajnal on topological complete subgraphs. European Journal of Combinatorics, 19(8), 883–887. https://doi.org/10.1006/eujc.1997.0188

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free