𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Trees in tournaments

✍ Scribed by Frédéric Havet


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
350 KB
Volume
5
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Trees in tournaments
✍ Roland Häggkvist; Andrew Thomason 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 396 KB
Rooted Spanning Trees in Tournaments
✍ Xiaoyun Lu; Da-Wei Wang; Jiaofeng Pan; C. K. Wong 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 192 KB
Onk-ary spanning trees of tournaments
✍ Lu, Xiaoyun; Wang, Da-Wei; Chang, Gerard J.; Lin, In-Jen; Wong, C. K. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

It is well known that every tournament contains a Hamiltonian path, which can be restated as that every tournament contains a unary spanning tree. The purpose of this article is to study the general problem of whether a tournament contains a k-ary spanning tree. In particular, we prove that, for any

Embedding tournaments in simple tourname
✍ J.W. Moon 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 693 KB

A tournament is simple if the corresp(!nding reEationa1 system is simple in the alge brnlc ~nse. it ir sh~un that cony F~~utnmlent T,, with IT nodes can be embedded in in simple tourrramant r \*+ 1 apart from two exceptional types of tournaments which can be embeddecl rn a %impie Fournczmtn t TR+ 1.

Bypaths in tournaments
✍ Yubao Guo; Lutz Volkmann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 559 KB

If every arc of a 3-connected tournament T is contained in a cycle of length 3, then every arc of T has a bypath of length k for each k > 3, unless T is isomorphic to two tournaments, each of which has exactly 8 vertices. This extends the corresponding result for regular tournaments, due to Alspach,

Even tournaments and Hadamard tournament
✍ Noboru Ito 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 309 KB

We discuss several tournaments. results and problems of even tournaments and Hadamard