论文信息 - COLORING SUBGRAPHS OF THE RADO GRAPH

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 k∈m 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 Ck.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.

Norbert Sauer

[1] Norbert Sauer,et al. The indivisibility of the homogeneous Kn-free graphs , 1989, J. Comb. Theory, Ser. B.

[2] Keith R. Milliken,et al. A Ramsey Theorem for Trees , 1979, J. Comb. Theory, Ser. A.

[3] Norbert Sauer,et al. On the divisibility of homogeneous directed graphs , 1993 .

[4] Norbert Sauer. Edge partitions of the countable triangle free homogeneous graph , 1998, Discret. Math..

[5] P. ERDŐS-A. HAJNAL-L. PÓSA. STRONG EMBEDDINGS OF GRAPHS INTO COLORED GRAPHS , 2004 .

[6] Norbert Sauer. Canonical Vertex Partitions , 2003, Comb. Probab. Comput..

[7] Combinatorics Springer-Verlag. Coloring of Universal Graphs , 1986 .

[8] Maurice Pouzet,et al. Edge partitions of the Rado graph , 1996, Comb..