✦ LIBER ✦

A well-quasi-order for tournaments

✍ Scribed by Maria Chudnovsky; Paul Seymour

Book ID: 108167492
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 154 KB
Volume: 101
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2010.10.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal Antichains in Well-founded Quasi

Minimal Antichains in Well-founded Quasi-orders with an Application to Tournaments

✍ Gregory L. Cherlin; Brenda J. Latka 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 190 KB

We investigate the minimal antichains (in what is essentially Nash-Williams' sense) in a well-founded quasi-order. We prove the following finiteness theorem: If Q is a well-founded quasi-order and k a fixed natural number, then there is a finite set 4 k of minimal antichains of Q with the property t

Well rewrite orderings and well quasi-or

Well rewrite orderings and well quasi-orderings

✍ Pierre Lescanne 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 791 KB

Gap Embedding for Well-Quasi-Orderings

✍ Nachum Dershowitz; Iddo Tzameret 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 683 KB

Well Quasi-Ordered Sets

✍ F. Richman; G. Stolzenberg 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 322 KB

Quasi-random tournaments

✍ F. R. K. Chung; R. L. Graham 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 724 KB

## Abstract We introduce a large class of tournament properties, all of which are shared by almost all random tournaments. These properties, which we term “quasi‐random,” have the property that tournaments possessing any one of the properties must of necessity possess them all. In contrast to rando

Subgraphs and well-quasi-ordering

✍ Guoli Ding 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 712 KB

## Abstract Let 𝒴 be a class of graphs and let ⪯ be the subgraph or the induced subgraph relation. We call ⪯ an __ideal__ (with respect to ⪯) if ⪯ implies that ⪯. In this paper, we study the ideals that are well‐quasiordered by ⪯. The following are our main results. If ⪯ is the subgraph relation, w