Reducts of the Henson graphs with a constant

DOI10.1016/j.apal.2017.01.009zbMath1422.03065OpenAlexW2585262910MaRDI QIDQ526969

András Pongrácz

Publication date: 15 May 2017

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2017.01.009

zbMATH Keywords

automorphismRamsey theoryhomogeneous graphreductfirst-order interdefinability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Ramsey theory (05D10) Models with special properties (saturated, rigid, etc.) (03C50) Interpolation, preservation, definability (03C40) Quantifier elimination, model completeness, and related topics (03C10) Categoricity and completeness of theories (03C35) Infinite graphs (05C63)

Related Items (4)

Hereditary G-compactness ⋮ Constraint Satisfaction Problems for Reducts of Homogeneous Graphs ⋮ Unnamed Item ⋮ Functional reducts of the countable atomless Boolean algebra

Cites Work

• Unnamed Item
• Ramsey classes of set systems
• Transitivity of permutation groups on unordered sets
• Partitions of finite relational and set systems
• Reducts of random hypergraphs
• Minimal functions on the random graph
• Schaefer's Theorem for Graphs
• Reducts of Ramsey structures
• The 116 reducts of (ℚ, <, a)
• Countable Ultrahomogeneous Undirected Graphs
• Reducts of the random graph
• Decidability of Definability
• A family of countable homogeneous graphs

This page was built for publication: Reducts of the Henson graphs with a constant