✦ LIBER ✦

Embedding tournaments in simple tournaments

✍ Scribed by J.W. Moon

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 693 KB
Volume: 2
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(72)90016-7

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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.

In-Tournament Digraphs

✍ J. Bangjensen; J. Huang; E. Prisner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 859 KB

Vertex pancyclic in-tournaments

✍ Meike Tewes; Lutz Volkmann 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

Weakening arcs in tournaments

✍ Denis Hanson; John W. Moon 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract A weakening arc of an irreducible tournament is an arc whose reversal creates a reducible tournament. We consider properties of such arcs and derive recurrence relations for enumerating strong tournaments with no such arcs, one or more such arcs, and exactly one such arc. We also give s

Cycles in Multipartite Tournaments

✍ Y.B. Guo; L. Volkmann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 132 KB

Finding Scores in Tournaments

✍ R Balasubramanian; Venkatesh Raman; G Srinivasaragavan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 181 KB

A tournament T is an orientation of the complete graph on n vertices. We n w continue the algorithmic study initiated by Hell and Rosenfeld J. Algorithms 4 Ž . x 1983 , 303᎐309 of recognizing various directed trees in tournaments. Hell and Rosenfeld studied the complexity of finding various oriente