Let [n] denote the n-set {1,2, . . . , n}, let k, 12 1 be integers. Define fi(n, k) as the minimum number f such that for every family F c 2'"' with (F( > f, for every k-coloring of [n], there exists a chain A, E. . . f Al+, in F in which the set of added elements, AI+l-A1, is monochromatic. We sur
✦ LIBER ✦
A Ramsey-Sperner theorem
✍ Scribed by Z. Füredi
- Book ID
- 110567463
- Publisher
- Springer Japan
- Year
- 1985
- Tongue
- English
- Weight
- 266 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Ramsey–Sperner theory
✍
Zoltán Füredi; Jerrold R. Griggs; Andrew M. Odlyzko; James B. Shearer
📂
Article
📅
1987
🏛
Elsevier Science
🌐
English
⚖ 667 KB
A sperner-type theorem
✍
Attila Sali
📂
Article
📅
1985
🏛
Springer Netherlands
🌐
English
⚖ 225 KB
A Euclidean Ramsey theorem
✍
M. Bóna
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 168 KB
In this note we shall prove a geometric Ramsey theorem. Let T be a triangle with angles 30, 60 and 90 degrees, and with hypotenus of unit length. Then the theorem says that if one threecolors the 3-space, then there is always a copy of T with monochromatic vertices. We shall also show that there is
A linear Ramsey theorem
✍
David Feldman; James Propp
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 350 KB
Hypergraphs and Sperner's theorem
✍
B. Monjardet
📂
Article
📅
1973
🏛
Elsevier Science
🌐
English
⚖ 237 KB
A sperner-type theorem and qualitative i
✍
János Körner; Gábor Simonyi
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 603 KB