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.
Publié le : 2005-07-14
Classification:
Ramsey theory,
partition relation,
relational structure,
canonical partition,
enumeration,
random graph,
Rado graph,
03E02,
03C15,
05A15
@article{1125409332,
author = {Larson, Jean A.},
title = {Ramsey Theory for Countable Binary Homogeneous Structures},
journal = {Notre Dame J. Formal Logic},
volume = {46},
number = {3},
year = {2005},
pages = { 335-352},
language = {en},
url = {http://dml.mathdoc.fr/item/1125409332}
}
Larson, Jean A. Ramsey Theory for Countable Binary Homogeneous Structures. Notre Dame J. Formal Logic, Tome 46 (2005) no. 3, pp. 335-352. http://gdmltest.u-ga.fr/item/1125409332/