On well-quasi-ordering finite structures with labels

DOI10.1007/BF01787479zbMath0699.06003OpenAlexW1972783806MaRDI QIDQ912875

Igor Kriz, Robin Thomas

Publication date: 1990

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01787479

zbMATH Keywords

labeling by ordinalslabelings of concrete categories of finite sets and injectionswell- quasi-ordered labelings

Mathematics Subject Classification ID

Partial orders, general (06A06) Preorders, orders, domains and lattices (viewed as categories) (18B35)

Related Items (8)

Minimal bad sequences are necessary for a uniform Kruskal theorem ⋮ Labelled well-quasi-order for permutation classes ⋮ Well-quasi-order of relabel functions ⋮ Labelled induced subgraphs and well-quasi-ordering ⋮ Fixed points and Noetherian topologies ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ In memoriam: Professor Robin Thomas (1962--2020)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
• The theory of well-quasi-ordering: a frequently discovered concept
• Nonconstructive tools for proving polynomial-time decidability
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras
• Partial well‐ordering of sets of vectors

This page was built for publication: On well-quasi-ordering finite structures with labels