Skip to main content
Log in

COLORING SUBGRAPHS OF THE RADO GRAPH

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and 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

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-006-0015-0

Mathematics Subject Classification (2000):

Navigation