𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A proof of Sumnerʼs universal tournament conjecture for large tournaments

✍ Scribed by Deryk Osthus; Daniela Kühn; Richard Mycroft

Book ID
119236633
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
169 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Squaring a tournament: A proof of Dean's
Squaring a tournament: A proof of Dean's conjecture
✍ Fisher, David C. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 2 views

Let the square of a tournament be the digraph on the same nodes with arcs where the directed distance in the tournament is at most two. This paper verifies Dean's conjecture: any tournament has a node whose outdegree is at least doubled in its square. 0

Oriented Hamiltonian Paths in Tournament
Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture
✍ Frédéric Havet; Stéphan Thomassé 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 284 KB

We prove that with three exceptions, every tournament of order n contains each oriented path of order n. The exceptions are the antidirected paths in the 3-cycle, in the regular tournament on 5 vertices, and in the Paley tournament on 7 vertices. ## 2000 Academic Press Tournaments are very rich st

Landau's inequalities for tournament sco
Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
✍ Richard A. Brualdi; Jian Shen 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

Ao and Hanson, and Guiduli, Gya  rfa  s, Thomasse  and Weidl independently, proved the following result: For any tournament score sequence S (s 1 , s 2 ,F F F,s n ) with s 1 s 2 Á Á Á s n , there exists a tournament T on vertex set f1Y 2Y F F F Y ng such that the score of each vertex i is s i an