For graphs there are only four types of hereditary Ramsey classes

DOI10.1016/0095-8956(89)90038-5zbMath0736.05071OpenAlexW2166495646MaRDI QIDQ1812632

Jaroslav Nešetřil

Publication date: 25 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90038-5

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Structural characterization of families of graphs (05C75) Ramsey theory (05D10)

Related Items

Ramsey classes with forbidden homomorphisms and a closure ⋮ Bowtie-free graphs have a Ramsey lift ⋮ Ramsey classes of topological and metric spaces ⋮ Splittings and Ramsey properties of permutation classes ⋮ Some recollections on early work with Jan Pelant ⋮ EPPA for two-graphs and antipodal metric spaces ⋮ Fixed points in compactifications and combinatorial counterparts ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) ⋮ Unnamed Item ⋮ Finite presentation of homogeneous graphs, posets and Ramsey classes

Cites Work

• Unnamed Item
• Unnamed Item
• Ramsey classes of set systems
• Partitions of finite relational and set systems
• Ramsey's theorem for a class of categories
• Countable Ultrahomogeneous Undirected Graphs