✦ LIBER ✦

On a bottleneck bipartition conjecture of Erdős

✍ Scribed by T. D. Porter

Publisher: Springer-Verlag
Year: 1992
Tongue: English
Weight: 194 KB
Volume: 12
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01285820

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On a conjecture of Bollobás and Erdős

✍ John L. Leonard 📂 Article 📅 1973 🏛 Springer Netherlands 🌐 English ⚖ 145 KB

Proof of the Erdős–Faudree Conjecture on

Proof of the Erdős–Faudree Conjecture on Quadrilaterals

✍ Hong Wang 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 690 KB

Proof Of A Conjecture Of Erdős On Triang

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

✍ Dhruv Mubayi; Jacques Verstraëte 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 281 KB

A random walk proof of the Erdős-Taylor

A random walk proof of the Erdős-Taylor conjecture

✍ Jay Rosen 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 244 KB

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