𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Erdős-diameter of sets

✍ Scribed by Peter Brass

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
224 KB
Volume
150
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Erdős-Sós Conjecture for trees of di
The Erdős-Sós Conjecture for trees of diameter four
✍ Andrew McLennan 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

## Abstract The Erdős‐Sós Conjecture is that a finite graph __G__ with average degree greater than __k__ − 2 contains every tree with __k__ vertices. Theorem 1 is a special case: every __k__‐vertex tree of diameter four can be embedded in __G__. A more technical result, Theorem 2, is obtained by ex

On a Problem of Erdős
On a Problem of Erdős
✍ Csaba Sándor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Theorem 1. For every n 2 there exist integers 1<a 1 <a 2 < } } } <a s such that s i=1 1Âa i <n and this sum cannot be split into n parts so that all partial sums are 1.

Erdős and the Integers
Erdős and the Integers
✍ Imre Z. Ruzsa 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 471 KB
Extending the Erdős–Ko–Rado theorem
Extending the Erdős–Ko–Rado theorem
✍ Norihide Tokushige 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 75 KB

## Abstract Let ${\cal F}$ be a __k__‐uniform hypergraph on __n__ vertices. Suppose that $|F\_{1}\cap \cdots \cap F\_{r}|\ge t$ holds for all $F\_{1},\ldots ,F\_{r}\in {\cal F}$. We prove that the size of ${\cal F}$ is at most ${{n-t}\choose {k-t}}$ if $p= {k \over n}$ satisfies and __n__ is suffi