Seminar series
Date
Tue, 30 Oct 2007
15:30
15:30
Location
L3
Speaker
Pierre Charbit
Organisation
Paris
The Rado Graph R is a graph on a countably infinite number of vertices that can be characterized by the following property: for every pair of finite, disjoint subsets of vertices X and Y, there exists a vertex that is adjacent to every vertex in X and none in Y. It is often called the Random Graph for the following reason: for any 0