Well-quasi-ordering and Embeddability of Relational Structures
From MaRDI portal
Cites work
- A counterexample regarding labelled well-quasi-ordering
- A decomposition theorem for partially ordered sets
- A proof of the rooted tree alternative conjecture
- An order type decomposition theorem
- Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
- Application de la Notion de Relation Presque‐Enchainable au Denombrement des Restrictions Finies D'une Relation
- Bipartite induced subgraphs and well-quasi-ordering
- Boundary properties of well-quasi-ordered sets of graphs
- Canonical antichains of unit interval and bipartite permutation graphs
- Chaînes de théories universelles
- Coinductive ℵ0-categorical theories
- Condition de chaîne en théorie des rélations
- Countable structures of given age
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Divisibility of countable metric spaces
- Equimorphy: the case of chains
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Extension of hereditary classes with substitutions
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- From well to better, the space of ideals
- Graphs indecomposable with respect to the X-join
- Growth Rates in Infinite Graphs and Permutation Groups
- Hereditary classes of ordered binary structures
- Hereditary properties of combinatorial structures: Posets and oriented graphs
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs
- HOMOGENEOUS RELATIONS
- Hypomorphy of graphs up to complementation
- Incidence structures and Stone-Priestley duality
- Indecomposable graphs
- Indivisible ultrametric spaces
- Induced subgraphs and well‐quasi‐ordering
- Infinite independent sets in distributive lattices
- Infinite Permutation Groups of Rapid Growth
- Jumps in speeds of hereditary properties in finite relational languages
- Jónsson posets and unary Jónsson algebras
- Labelled induced subgraphs and well-quasi-ordering
- Mutually embeddable graphs and the tree alternative conjecture
- On a class of order-type generalizing ordinals
- On an algebra related to orbit-counting
- On better quasi-ordering countable trees
- On Better-Quasi-Ordering Countable Series-Parallel Orders
- On families of mutually exclusive sets
- On Fraissé's order type conjecture
- On incidence matrices of finite projective and affine spaces
- On minimal prime graphs and posets
- On the size of hereditary classes of graphs
- On the size of jump-critical ordered sets
- On unavoidable-induced subgraphs in large prime graphs
- Orbits of Permutation Groups on Unordered Sets
- Orbits of Permutation Groups on Unordered Sets, II
- Ordered sets with no infinite antichains
- Ordering by Divisibility in Abstract Algebras
- Partially well ordered sets and partial ordinals
- Possible Orderings of an Indiscernible Sequence
- Proof-theoretic investigations on Kruskal's theorem
- Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
- Rationality for subclasses of 321-avoiding permutations
- Relation Minimale Pour Son Ǎge
- Relational structures determined by their finite induced substructures
- Relational structures having finitely many full-cardinality restrictions
- Representation of Distributive Lattices by means of ordered Stone Spaces
- Representation of ideals of relational structures
- Sandwiches of ages
- Simple permutations and pattern restricted permutations
- Some theorems on graphs and posets
- Sperner properties for groups and relations
- Subgraphs and well‐quasi‐ordering
- Superatomic Boolean algebras
- Sur les types d'ordre des ensembles linéaires
- The 3-Irreducible Partially Ordered Sets
- The Complexity of Near-Optimal Graph Coloring
- The Complexity of the Partial Order Dimension Problem
- The length of an intersection
- The morphology of infinite tournaments; application to the growth of their profile
- The order type of the collection of finite series-parallel posets
- The strong perfect graph theorem
- The theory of well-quasi-ordering: a frequently discovered concept
- The unlabelled speed of a hereditary graph property
- Transitivity of permutation groups on unordered sets
- Twins of rayless graphs
- Unavoidable induced subgraphs in large graphs with no homogeneous sets
- Universally Complete Universal Theories
- When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron
This page was built for publication: Well-quasi-ordering and Embeddability of Relational Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493759)
