✦ LIBER ✦

Well-quasi-ordered classes of groups

✍ Scribed by Roger M Bryant

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 883 KB
Volume: 43
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(76)90133-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Well Quasi-Ordered Sets

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

Classes of Ultrasimplicial Lattice-Order

Classes of Ultrasimplicial Lattice-Ordered Abelian Groups

✍ Daniele Mundici 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 71 KB

A lattice-ordered abelian group is called ultrasimplicial iff every finite set of positive elements belongs to the monoid generated by some finite set of positive Z-independent elements. This property originates from Elliott's classification of AF C U -algebras. Using fans and their desingularizatio

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

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

Spinor class groups of orders

✍ J Brzezinski 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 873 KB

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