Ramsey-type properties of relational structures
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3823785 (Why is no real title available?)
- scientific article; zbMATH DE number 3536154 (Why is no real title available?)
- A family of countable homogeneous graphs
- Coloring of universal graphs
- Countable Homogeneous Tournaments
- Countable Ultrahomogeneous Undirected Graphs
- Countable homogeneous partially ordered sets
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- On countable stable structures which are homogeneous for a finite relational language
- On the Divisibility of Homogeneous Directed Graphs
- On the divisibility of homogeneous hypergraphs
- Partitions of finite relational and set systems
- Theory of relations. Transl. from the French by P. Clote
Cited in
(18)- On the divisibility of homogeneous hypergraphs
- Inexhaustible homogeneous structures
- Generalized pigeonhole properties of graphs and oriented graphs
- Indicators, chains, antichains, Ramsey property
- Many symmetrically indivisible structures
- Antichains of copies of ultrahomogeneous structures
- Positive families and Boolean chains of copies of ultrahomogeneous structures
- Age and weak indivisibility
- On dual Ramsey theorems for relational structures
- Representation of ideals of relational structures
- On products of elementarily indivisible structures
- Ranks based on strong amalgamation Fraïssé classes
- Relational structures determined by their finite induced substructures
- Partitions and indivisibility properties of countable dimensional vector spaces
- Ramsey theory of homogeneous structures: current trends and open problems
- Splittings and Ramsey properties of permutation classes
- Products of classes of finite structures
- On symmetric indivisibility of countable structures
This page was built for publication: Ramsey-type properties of relational structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182733)
