𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Subdivisions of Transitive Tournaments

✍ Scribed by A.D. Scott

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
77 KB
Volume
21
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that, for r ≥ 2 and n ≥ n(r ), every directed graph with n vertices and more edges than the r -partite Turán graph T (r, n) contains a subdivision of the transitive tournament on r + 1 vertices. Furthermore, the extremal graphs are the orientations of T (r, n) induced by orderings of the vertex classes.

📜 SIMILAR VOLUMES

2-Partition-Transitive Tournaments
2-Partition-Transitive Tournaments
✍ Barry Guiduli; András Gyárfás; Stéphan Thomassé; Peter Weidl 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 326 KB

Given a tournament score sequence s 1 s 2 } } } s n , we prove that there exists a tournament T on vertex set [1, 2, ..., n] such that the degree of any vertex i is s i and the subtournaments of T on both the even and the odd vertices are transitive in the given order. This means that i beats j when

Transitive tournaments and self-compleme
Transitive tournaments and self-complementary graphs
✍ András Gyárfás 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 55 KB

## Abstract A simple proof is given for a result of Sali and Simonyi on self‐complementary graphs. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 111–112, 2001

Simple tournaments and sharply transitiv
Simple tournaments and sharply transitive groups
✍ Wilfried Imrich; Jaroslav Nešetřil 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 486 KB

We prove that with the possible exception of total orders every tournament with sharply transitive group of automorphisms is simple.

On a conjecture of Brualdi and Shen on b
On a conjecture of Brualdi and Shen on block transitive tournaments
✍ P. Acosta; A. Bassa; A. Chaikin; A. Riehl; A. Tingstad; L. Zhao; D. J. Kleitman 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

## Abstract The following conjecture of Brualdi and Shen is proven in this paper: let __n__ be partitioned into natural numbers no one of which is greater than (__n__ + 1) / 2. Then, given any sequence of wins for the players of some tournament among n players, there is a partition of the players i

Vertices of the generalized transitive t
Vertices of the generalized transitive tournament polytype
✍ Alberto Borobia 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 249 KB

A nonnegative matrix T = (t~)~= t is a generalized transitive tournament matrix (GTT matrix) ift, = 0, t~ = 1 -tjl for i ~j, and 1 ~< t~ i + t~. + tk~ ~< 2 for i,j,k pairwise distinct. An approach to the problem of characterize the set of vertices of the polytope {GTT }, of all GTT matrices of order