Forbidden substructures and combinatorial dichotomies: WQO and universality
From MaRDI portal
Publication:2275384
Recommendations
Cites work
- A problem of Ulam on planar graphs
- An infinite antichain of permutations
- Countable homogeneous coloured partial orders
- Countable homogeneous relational structures and ℵ0-categorical theories
- Countable Ultrahomogeneous Undirected Graphs
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Finitely constrained classes of homogeneous directed graphs
- Forbidden subgraphs and forbidden substructures
- Graphs omitting a finite set of cycles
- Grid classes and the Fibonacci dichotomy for restricted permutations
- Homogeneous permutations
- scientific article; zbMATH DE number 3902684 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 3492580 (Why is no real title available?)
- scientific article; zbMATH DE number 1303203 (Why is no real title available?)
- scientific article; zbMATH DE number 2107707 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3400958 (Why is no real title available?)
- scientific article; zbMATH DE number 3198033 (Why is no real title available?)
- Letter graphs and well-quasi-order by induced subgraphs
- Minimal antichains in well-founded quasi-orders with an application to tournaments
- On the existence of countable universal graphs
- Ordering by Divisibility in Abstract Algebras
- Partially well-ordered closed sets of permutations
- Profile classes and partial well-order for permutations
- Some remarks on universal graphs
- Some universal graphs
- Sorting Using Networks of Queues and Stacks
- Structure theorem for tournaments omitting N5
- Subgraphs and well‐quasi‐ordering
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- The undecidability of the domino problem
- Universal arrow-free graphs
- Universal graphs and universal functions
- Universal graphs with a forbidden near‐path or 2‐bouquet
- Universal graphs with a forbidden subtree
- Universal graphs with forbidden subgraphs and algebraic closure
- Universal graphs without large bipartite subgraphs
- Well-quasi-order of relabel functions
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Well-quasi-orderings and sets of finite sequences
Cited in
(14)- First-order model theory of free projective planes
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
- Homomorphic image orders on combinatorial structures.
- On well quasi-order of graph classes under homomorphic image orderings
- Bowtie-free graphs have a Ramsey lift
- Forbidden subgraphs and forbidden substructures
- Boundary properties of well-quasi-ordered sets of graphs
- Metrically homogeneous graphs of diameter \(3\)
- Labelled well-quasi-order for permutation classes
- The undecidability of joint embedding for 3-dimensional permutation classes
- Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
- WQO dichotomy for 3-graphs
- Decidability of well quasi-order and atomicity for equivalence relations under embedding orderings
- Homogeneity and homogenizability: hard problems for the logic SNP
This page was built for publication: Forbidden substructures and combinatorial dichotomies: WQO and universality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275384)
