✦ LIBER ✦

An extremal problem on random trees

✍ Scribed by Yu. P. Laptin

Publisher: Springer US
Year: 1981
Tongue: English
Weight: 321 KB
Volume: 17
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069644

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On an Extremal Problem for Colored Trees

✍ P. Valtr 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Let T be a tree such that there is a proper n-coloring c of the vertices of T which, besides a technical condition, is a k b k a k -free, i.e., T contains no subdivision of a path u 1 , . . . , Then T has O(kn) vertices. (The technical condition requires that T contains no subdivision of a properly

Extremal cover times for random walks on

Extremal cover times for random walks on trees

✍ Graham Brightwell; Peter Winkler 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB

## Abstract Let __C~ν~__(__T__) denote the “cover time” of the tree __T__ from the vertex __v__, that is, the expected number of steps before a random walk starting at __v__ hits every vertex of __T.__ Asymptotic lower bounds for __C~ν~__(__T__) (for __T__ a tree on __n__ vertices) have been obtain

On an extremal problem

✍ I. Dancs 📂 Article 📅 1958 🏛 Akadmiai Kiad 🌐 English ⚖ 160 KB

An extremal problem

✍ R. E. L. Turner 📂 Article 📅 1968 🏛 Akadmiai Kiad 🌐 English ⚖ 178 KB

An extremal coloring problem on matrices

✍ Hans-Dietrich O.F Gronau; Roger Labahn 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 201 KB

On an extremal problem of Fejér

✍ Tai-Shing Lau; W.J Studden 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 453 KB