𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof Of A Conjecture Of Erdős On Triangles In Set-Systems

✍ Scribed by Dhruv Mubayi; Jacques Verstraëte

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
281 KB
Volume
25
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

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

On a conjecture of Erdős, Graham and Spe
On a conjecture of Erdős, Graham and Spencer
✍ Yong-Gao Chen 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 102 KB

It is conjectured by Erdős, Graham and Spencer that if 1 a 1 a 2 • • • a s with s i=1 1/a i < n -1/30, then this sum can be decomposed into n parts so that all partial sums are 1. This is not true for s i=1 1/a i = n -1/30 as shown by In 1997, Sándor proved that Erdős-Graham-Spencer conjecture is t