Edge partitions of the Rado graph

  title={Edge partitions of the Rado graph},
  author={Maurice Pouzet and Norbert Sauer},
We will prove that for every colouring of the edges of the Rado graph,ℛ (that is the countable homogeneous graph), with finitely many coulours, it contains an isomorphic copy whose edges are coloured with at most two of the colours. It was known [4] that there need not be a copy whose edges are coloured with only one of the colours. For the proof we use the lexicographical order on the vertices of the Rado graph, defined by Erdös, Hajnal and Pósa.Using the result we are able to describe a… 


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.

A Polychromatic Ramsey Theory for Ordinals

This work provides an explicit expression for computing the Ramsey degree given α and establishes a version of this result for automatic structures and demonstrates that a version for computable structures fails.

Multicoloured Random Graphs: Constructions and Symmetry

This is a research monograph on constructions of and group actions on countable homogeneous graphs, concentrating particularly on the simple random graph and its edge-coloured variants. We study

The Ramsey theory of the universal homogeneous triangle-free graph

The proof entails developments of new broadscale techniques, including a flexible method for constructing trees which code $\mathcal{H}_3$ and the development of their Ramsey theory.

Another Look at the Erdős–Hajnal–Pósa Results on Partitioning Edges of the Rado Graph

Erdős, Hajnal and Pósa exhibited a partition of the edges of the Rado graph which is a counterexample to and obtained that if every vertex of a graph has either in or in the complement of finite degree then .

Ramsey classes of topological and metric spaces

A List of Problems on the Reverse Mathematics of Ramsey Theory on the Rado Graph and on Infinite, Finitely Branching Trees

This list presents problems in the Reverse Mathematics of infinitary Ramsey theory which I find interesting but do not personally have the techniques to solve. The intent is to enlist the help of

Ramsey Theory on Infinite Structures and the Method of Strong Coding Trees

This article discusses some recent trends in Ramsey theory on infinite structures. Trees and their Ramsey theory have been vital to these investigations. The main ideas behind the author's recent

Borel sets of Rado graphs and Ramsey's Theorem

The well-known Galvin-Prikry Theorem states that Borel subsets of the Baire space are Ramsey: Given any Borel subset $\mathcal{X}\subseteq [\omega]^{\omega}$, where $[\omega]^{\omega}$ is endowed

The Ramsey Theory of Henson graphs

For $k\ge 3$, the Henson graph $\mathcal{H}_k$ is the analogue of the Rado graph in which $k$-cliques are forbidden. Building on the author's result for $\mathcal{H}_3$, we prove that for each $k\ge



Some Partitions of Three-Dimensional Combinatorial Cubes