✦ LIBER ✦

On Well-quasi-ordering Finite Sequences

✍ Scribed by Bollerhoff, Ulrich

Book ID: 122594246
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 291 KB
Volume: 10
Category: Article
ISSN: 0195-6698
DOI: 10.1016/S0195-6698(89)80055-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On well-quasi-ordering finite trees

✍ Nash-Williams, C. St. J. A. 📂 Article 📅 1963 🏛 Cambridge University Press 🌐 English ⚖ 562 KB

On well-quasi-ordering finite structures

On well-quasi-ordering finite structures with labels

✍ Igor Kříž; Robin Thomas 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 669 KB

On well-quasi-ordering-finite graphs by

On well-quasi-ordering-finite graphs by immersion

✍ Thomas Andreae 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 698 KB

Well-Quasi-Ordering of Sequences of Ordi

Well-Quasi-Ordering of Sequences of Ordinal Numbers

✍ Milner, E. C. 📂 Article 📅 1968 🏛 Oxford University Press 🌐 English ⚖ 166 KB

Well Quasi Ordering Finite Posets and Fo

Well Quasi Ordering Finite Posets and Formal Languages

✍ J. Gustedt 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 504 KB

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