✦ LIBER ✦

Well Quasi-Ordered Sets

✍ Scribed by F. Richman; G. Stolzenberg

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 322 KB
Volume: 97
Category: Article
ISSN: 0001-8708
DOI: 10.1006/aima.1993.1004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Induced subgraphs and well-quasi-orderin

Induced subgraphs and well-quasi-ordering

✍ Peter Damaschke 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB

## Abstract We study classes of finite, simple, undirected graphs that are (1) lower ideals (or hereditary) in the partial order of graphs by the induced subgraph relation ≤~i~, and (2) well‐quasi‐ordered (WQO) by this relation. The main result shows that the class of cographs (__P~4~__‐free graphs

Bipartite induced subgraphs and well-qua

Bipartite induced subgraphs and well-quasi-ordering

✍ Nicholas Korpelainen; Vadim V. Lozin 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

We study bipartite graphs partially ordered by the induced subgraph relation. Our goal is to distinguish classes of bipartite graphs that are or are not well-quasi-ordered (wqo) by this relation. Answering an open question from [J Graph Theory 16 (1992), 489-502], we prove that P 7 -free bipartite g

Branch-Width and Well-Quasi-Ordering in

Branch-Width and Well-Quasi-Ordering in Matroids and Graphs

✍ James F. Geelen; A.M.H. Gerards; Geoff Whittle 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Tree-Properties for Ordered Sets

✍ Olivier Esser; Roland Hinnion 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

In this paper, we study the notion of arborescent ordered sets, a generalization of the notion of tree-property for cardinals. This notion was already studied previously in the case of directed sets. Our main result gives a geometric condition for an order to be ℵ0-arborescent.

Matroids on Partially Ordered Sets

✍ Marilena Barnabei; Giorgio Nicoletti; Luigi Pezzoli 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 346 KB

## L dimension may be chosen within each of the subspaces L in the set S that are ''in general position.'' For example, in the real projective space of dimension 3, consider a plane , a line r not belonging to , the point P [ r l , and two distinct points Q, R both different from P, lying on the l

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