✦ LIBER ✦

Ramsey’s theorem for trees: the polarized tree theorem and notions of stability

✍ Scribed by Damir D. Dzhafarov; Jeffry L. Hirst; Tamara J. Lakins

Book ID: 105842388
Publisher: Springer
Year: 2010
Tongue: English
Weight: 251 KB
Volume: 49
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-010-0179-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalization of Ramsey's theorem for

A generalization of Ramsey's theorem for regular trees

✍ Walter Deuber 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 331 KB

Profiles of Random Trees: Limit Theorems

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees

✍ Michael Fuchs; Hsien-Kuei Hwang; Ralph Neininger 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 469 KB

Erdős–Ko–Rado theorems for chordal graph

Erdős–Ko–Rado theorems for chordal graphs and trees

✍ Glenn Hurlbert; Vikram Kamat 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 225 KB

On the sequential access theorem and deq

On the sequential access theorem and deque conjecture for splay trees

✍ Amr Elmasry 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Interpolation theorem for the number of

Interpolation theorem for the number of end-vertices of spanning trees

✍ Seymour Schuster 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract The following interpolation theorem is proved: If a graph __G__ contains spanning trees having exactly __m__ and __n__ end‐vertices, with __m__ < __n__, then for every integer __k, m < k < n, G__ contains a spanning tree having exactly __k__ end‐vertices. This settles a problem posed by

The Grassmann–Berezin calculus and theor

The Grassmann–Berezin calculus and theorems of the matrix-tree type

✍ Abdelmalek Abdesselam 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 285 KB