Ramsey Theory for Countable Binary Homogeneous Structures

Notre Dame Journal of Formal Logic 46 (3):335-352 (2005)
  Copy   BIBTEX

Abstract

Countable homogeneous relational structures have been studied by many people. One area of focus is the Ramsey theory of such structures. After a review of background material, a partition theorem of Laflamme, Sauer, and Vuksanovic for countable homogeneous binary relational structures is discussed with a focus on the size of the set of unavoidable colors

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1125409332

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The Ramsey theory of the universal homogeneous triangle-free graph.Natasha Dobrinen - 2020 - Journal of Mathematical Logic 20 (2):2050012.
Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.
Review: A. H. Lachlan, On Countable Stable Structures which are Homogeneous for a Finite Relational Language; G. Cherlin, A. H. Lachlan, Stable Finitely Homogeneous Structures. [REVIEW]Dugald Macpherson - 1993 - Journal of Symbolic Logic 58 (1):350-352.
Countable homogeneous relational structures and ℵ0-categorical theories.C. Ward Henson - 1972 - Journal of Symbolic Logic 37 (3):494 - 500.
The Ramsey theory of Henson graphs.Natasha Dobrinen - 2022 - Journal of Mathematical Logic 23 (1).
A Pigeonhole Property for Relational Structures.Anthony Bonato & Dejan Delić - 1999 - Mathematical Logic Quarterly 45 (3):409-413.
Ramsey classes of topological and metric spaces.Jaroslav Nešetřil - 2006 - Annals of Pure and Applied Logic 143 (1-3):147-154.
A recursion theoretic analysis of the clopen Ramsey theorem.Peter Clote - 1984 - Journal of Symbolic Logic 49 (2):376-400.
Homogeneous 1‐based structures and interpretability in random structures.Vera Koponen - 2017 - Mathematical Logic Quarterly 63 (1-2):6-18.
Towards a Ryll‐Nardzewski‐type theorem for weakly oligomorphic structures.Christian Pech & Maja Pech - 2016 - Mathematical Logic Quarterly 62 (1-2):25-34.

Analytics

Added to PP
2010-08-24

Downloads
36 (#658,719)

6 months
6 (#572,300)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Partitions of large Rado graphs.M. Džamonja, J. A. Larson & W. J. Mitchell - 2009 - Archive for Mathematical Logic 48 (6):579-606.

Add more citations

References found in this work

A new strongly minimal set.Ehud Hrushovski - 1993 - Annals of Pure and Applied Logic 62 (2):147-166.
Nonexistence of universal orders in many cardinals.Menachem Kojman & Saharon Shelah - 1992 - Journal of Symbolic Logic 57 (3):875-891.
ℵ0-categorical structures with a predimension.David M. Evans - 2002 - Annals of Pure and Applied Logic 116 (1-3):157-186.
Independence results.Saharon Shelah - 1980 - Journal of Symbolic Logic 45 (3):563-573.

View all 9 references / Add more references