Well quasi-order in combinatorics: embeddings and homomorphisms

DOI10.1017/CBO9781316106853.009zbMATH Open1352.05008OpenAlexW2222990103MaRDI QIDQ3179078FDOQ3179078

Authors: Sophie Huczynska, N. Ruškuc 

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

• Towards better: a motivated introduction to better-quasi-orders
• On well quasi-order of graph classes under homomorphic image orderings
• Well-Quasi Orders and Hierarchy Theory
• Well quasi-ordered sets
• scientific article; zbMATH DE number 3943872

zbMATH Keywords

homomorphisms in combinatorics

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Ordered sets (06A99)

Cited In (16)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Well quasi orders in a categorical setting
• Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
• Intersection quasi-orderings: An alternative proof
• A counterexample regarding labelled well-quasi-ordering
• Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21--25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17--22, 2016
• On well quasi-order of graph classes under homomorphic image orderings
• Labelled well-quasi-order for permutation classes
• 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
• Hereditarily structurally complete positive logics
• Algebraic representation, dualities and beyond
• 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)