We show that every graph G of size at least 256 p 2 |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.
A proof of Cunninghamʼs conjecture on restricted subgraphs and jump systems
✍ Scribed by Yusuke Kobayashi; Jácint Szabó; Kenjiro Takazawa
- Book ID
- 116630519
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 326 KB
- Volume
- 102
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Lindner's conjecture that any partial Steiner triple system of order __u__ can be embedded in a Steiner triple system of order __v__ if $v\equiv 1,3 \; ({\rm mod}\; 6)$ and $v\geq 2u+1$ is proved. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 63–89, 2009
## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume