Ramsey-type properties of relational structures

DOI10.1016/0012-365X(91)90301-HzbMath0746.03024MaRDI QIDQ1182733

Mohamed H. El-Zahar, Norbert W. Sauer

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

relational structureindivisibilityrelational language

Mathematics Subject Classification ID

Ramsey theory (05D10) Properties of classes of models (03C52) Relational systems, laws of composition (08A02)

Related Items (11)

Generalized pigeonhole properties of graphs and oriented graphs ⋮ On the divisibility of homogeneous hypergraphs ⋮ Antichains of copies of ultrahomogeneous structures ⋮ Many symmetrically indivisible structures ⋮ Ranks based on strong amalgamation Fraïssé classes ⋮ Ramsey theory of homogeneous structures: current trends and open problems ⋮ Products of classes of finite structures ⋮ Age and weak indivisibility ⋮ Positive families and Boolean chains of copies of ultrahomogeneous structures ⋮ Splittings and Ramsey properties of permutation classes ⋮ Inexhaustible homogeneous structures

Cites Work

• Unnamed Item
• Unnamed Item
• Coloring of universal graphs
• Theory of relations. Transl. from the French by P. Clote
• On countable stable structures which are homogeneous for a finite relational language
• Countable homogeneous partially ordered sets
• Partitions of finite relational and set systems
• On the divisibility of homogeneous hypergraphs
• Countable Ultrahomogeneous Undirected Graphs
• Countable Homogeneous Tournaments
• On the Divisibility of Homogeneous Directed Graphs
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• A family of countable homogeneous graphs

This page was built for publication: Ramsey-type properties of relational structures