Well quasi-order in combinatorics: embeddings and homomorphisms
From MaRDI portal
Publication:3179078
DOI10.1017/CBO9781316106853.009zbMATH Open1352.05008OpenAlexW2222990103MaRDI QIDQ3179078FDOQ3179078
Publication date: 20 December 2016
Published in: Surveys in Combinatorics 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/cbo9781316106853.009
Recommendations
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Ordered sets (06A99)
Cited In (14)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
- Algebraic Representation, Dualities and Beyond
- Intersection quasi-orderings: An alternative proof
- A counterexample regarding labelled well-quasi-ordering
- On well quasi-order of graph classes under homomorphic image orderings
- Labelled well-quasi-order for permutation classes
- HEREDITARILY STRUCTURALLY COMPLETE POSITIVE LOGICS
- On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
- Well-Quasi Orders and Hierarchy Theory
- Decidability of well quasi-order and atomicity for equivalence relations under embedding orderings
- Well‐quasi‐ordering and finite distinguishing number
- Title not available (Why is that?)
This page was built for publication: Well quasi-order in combinatorics: embeddings and homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179078)