𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs

✍ Scribed by B. Bollobás; A. Thomason

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
89 KB
Volume
19
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A Proof of a Partition Conjecture of Bat
A Proof of a Partition Conjecture of Bateman and Erdős
✍ Jason P Bell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Bateman and Erdo s found necessary and sufficient conditions on a set A for the kth differences of the partitions of n with parts in A, p (k) A (n), to eventually be positive; moreover, they showed that when these conditions occur p (k+1) A (n) tends to zero as n tends to infinity. Bateman and Erdo

Proof of a Conjecture of Bollobás and Ko
Proof of a Conjecture of Bollobás and Kohayakawa on the Erdős–Stone Theorem
✍ Yoshiyasu Ishigami 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 242 KB

For any integer r \ 1, let a(r) be the largest constant a \ 0 such that if E > 0 and 0 < c < c 0 for some small c 0 =c 0 (r, E) then every graph G of sufficiently large order n and at least edges contains a copy of any (r+1)-chromatic graph H of independence number a(H) [ (a -E) log n log(1/c) .

Proof of a Conjecture of Bollob?s on Nes
Proof of a Conjecture of Bollob?s on Nested Cycles
✍ Guantao Chen; Paul Erdós; William Staton 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

For any positive integer k, a minimum degree condition is obtained which forces a graph to have k edge-disjoint cycles C 1 , C 2 , ..., C k such that V(C 1

On a conjecture of Aris: Proof and remar
On a conjecture of Aris: Proof and remarks
✍ Dan Luss; Neal R. Amundson 📂 Article 📅 1967 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 428 KB 👁 2 views
Proof of a conjecture on game domination
Proof of a conjecture on game domination
✍ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami; L. Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## 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