𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Errors in diagnosis, avoidable and unavoidable

✍ Scribed by Alfred Penny

Book ID
112958443
Publisher
Springer-Verlag
Year
1902
Tongue
English
Weight
393 KB
Volume
114
Category
Article
ISSN
1863-4362

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On avoidable and unavoidable claws
On avoidable and unavoidable claws
✍ Xiaoyun Lu; Da-Wei Wang; C.K. Wong πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 316 KB

A claw of degree k is a directed tree consisting of k paths emerging from a common root. We 19 prove that every claw of order n with degree less than ~n appears in every n-vertex tournament. u Thus for large n, the maximum We also construct avoidable claws with degree approaching i3n. tl 2 such tha

On avoidable and unavoidable trees
On avoidable and unavoidable trees
✍ Xiaoyun Lu πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 574 KB

A directed tree is a rooted tree if there is one vertex (the root) of in-degree 0 and every other vertex has in-degree 1. The depth of a rooted tree is the length of a longest path from the root. A directed graph G is called n-unavoidable if every tournament of order n contains it as a subgraph. M.