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
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
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.
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,
We discuss several tournaments. results and problems of even tournaments and Hadamard