COLORING SUBGRAPHS OF THE RADO GRAPH

A Ramsey theorem for trees

Keith R. Milliken · Journal of Combinatorial Theory Series A · 1979 · 109 citations

Natural Sciences, Mathematics, Combinatorics +12

Coloring of universal graphs

Péter Komjáth, Vojtěch Rödl · Graphs and Combinatorics · 1986 · 39 citations

Natural Sciences, Visualization, Combinatorics +4

The indivisibility of the homogeneous Kn-free graphs

Mohamed H. El-Zahar, N. Sauer · Journal of Combinatorial Theory Series B · 1989 · 36 citations

Natural Sciences, Computer Science, Mathematics +6

Canonical Vertex Partitions

N. Sauer · Combinatorics Probability Computing · 2003 · 24 citations

Natural Sciences, Computer Science, Mathematics +7

Edge partitions of the Rado graph

Maurice Pouzet, Norbert Sauer · COMBINATORICA · 1996 · 24 citations

Natural Sciences, High-performance Computing, Combinatorics +6