COLORING SUBGRAPHS OF THE RADO GRAPH

Given a universal binary countable homogeneous structure U and n∈ω, there is a partition of the induced n-element substructures of U into finitely many classes so that for any partition C0,C1, . . .,Cm−1 of such a class Q into finitely many parts there is a number km and a copy U* of U in U so that all of the induced n-element substructures of U* which are in Q are also in C k .

The partition of the induced n-element substructures of U is explicitly given and a somewhat sharper result as the one stated above is proven.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Corresponding author

Correspondence to N. W. Sauer*.

Additional information

* Supported by NSERC of Canada Grant # 691325.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Sauer*, N.W. COLORING SUBGRAPHS OF THE RADO GRAPH. Combinatorica 26, 231–253 (2006). https://doi.org/10.1007/s00493-006-0015-0

Download citation

Mathematics Subject Classification (2000):

  • 03E02
  • 03E05