Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
type: Item
instance of: scholarly article
title: Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
zbMATH Open document ID: 0918.05095
author: Béla Bollobás
author: Andrew Thomason
published in: European Journal of Combinatorics
publication date: 1999-08-10T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 1248162
zbMATH Keywords: topological complete subgraphs
Wikidata QID: Q123133412
reviewed by: Jozef Širáň
MaRDI profile type: Publication
OpenAlex ID: W2084389562
DOI: 10.1006/EUJC.1997.0188
Recommended article: Q5331113
Recommended article: Proof of Mader's conjecture on k‐critical n‐connected graphs
Recommended article: Q4989607
Recommended article: Q3313888
Recommended article: Q3478424
Recommended article: A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree \(k\)
Recommended article: Extremal digraph results for topological complete subgraphs
Recommended article: Proof of a conjecture on induced subgraphs of Ramsey graphs
Recommended article: Q4004559
Recommended article: A proof of a conjecture on the connected domination number
description: scientific article; zbMATH DE number 1248162