𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof of a Conjecture of Bollobás and Kohayakawa on the Erdős–Stone Theorem

✍ Scribed by Yoshiyasu Ishigami

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
242 KB
Volume
85
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

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) .

📜 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

On a conjecture of bollobás and bosák
On a conjecture of bollobás and bosák
✍ Štefan Znám 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 364 KB

## Abstract It is shown that, for all sufficiently large __k__, the complete graph __K~n~__ can be decomposed into __k__ factors of diameter 2 if and only if __n__ ≥ 6__k__.

Proof of a Conjecture of Mader, Erdös an
Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs
✍ B. Bollobás; A. Thomason 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 89 KB

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.

On a Problem of Erdős and Sárközy
On a Problem of Erdős and Sárközy
✍ Tomasz Schoen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 89 KB

Let A=[a 1 , a 2 , ...] N and put A(n)= a i n 1. We say that A is a P-set if no element a i divides the sum of two larger elements. It is proved that for every P-set A with pairwise co-prime elements the inequality A(n)<2n 2Â3 holds for infinitely many n # N. ## 2001 Academic Press where A(n)= a i