𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Egoroff’s theorem and maximal run length

✍ Scribed by Ji-Hua Ma; Sheng-You Wen; Zhi-Ying Wen


Publisher
Springer Vienna
Year
2007
Tongue
English
Weight
72 KB
Volume
151
Category
Article
ISSN
0026-9255

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Turán's Theorem and Maximal Degrees
✍ Béla Bollobás 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 89 KB

graphs of order n and size at least t r (n) that do not have a vertex x of maximal degree d x whose neighbours span at least t r&1 (d x )+1 edges. Furthermore, we show that, for every graph G of order n and size at least t r (n), the degree-greedy algorithm used by Bondy (1983, J. Combin. Theory Ser