On Better-Quasi-Ordering Countable Series-Parallel Orders

DOI10.1090/S0002-9947-99-02400-9zbMath0944.05052MaRDI QIDQ4955694

Steéphan Thomassé

Publication date: 22 May 2000

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-99-02400-9

zbMATH Keywords

tree; comparability graph; better-quasi-orders; series-parallel posets; well-quasi-ordered; series-parallel digraphs; conjecture of Pouzet

Mathematics Subject Classification ID

05C05: Trees

05C75: Structural characterization of families of graphs

05C20: Directed graphs (digraphs), tournaments

08A65: Infinitary algebras

Related Items

Siblings of an $\aleph_0$-categorical relational structure, On structural descriptions of lower ideals of series parallel posets, Well-quasi-order of relabel functions, An example of formalizing recent mathematical results in MIZAR, The role of the Mizar mathematical library for interactive proof development in Mizar, Dickson's lemma, Higman's theorem and beyond: a survey of some basic results in order theory, Reducing the dichromatic number via cycle reversions in infinite digraphs, Well, Better and In-Between

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orders: description and roles in set theory, lattices, ordered groups, topology, theory of models and relations, combinatorics, effectiveness, social sciences. Proceedings of the Conference of Ordered Sets and their Applications, Château de la Tourette, l'Arbresle, July 5-11, 1982
• On better quasi-ordering countable trees
• On Fraissé's order type conjecture
• Transitiv orientierbare Graphen
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Concerning similarity transformations of linearly ordered sets
• Ordering by Divisibility in Abstract Algebras
• Partial well‐ordering of sets of vectors