Top Posts
Recent comments
Blogroll
- Astronomy Picture of the Day
- Azimuth
- British Combinatorial Committee
- Comfortably numbered
- Diamond Geezer
- Exploring East London
- From hill to sea
- Gödel's lost letter and P=NP
- Gil Kalai
- Jane's London
- Jon Awbrey
- Kourovka Notebook
- LMS blogs page
- Log24
- London Algebra Colloquium
- London Reconnections
- MathBlogging
- Micromath
- Neill Cameron
- neverendingbooks
- Noncommutative geometry
- numericana hall of fame
- Ratio bound
- Robert A. Wilson's blog
- Since it is not …
- Spitalfields life
- Sylvy's mathsy blog
- SymOmega
- Terry Tao
- The Aperiodical
- The De Morgan Journal
- The ICA
- The London column
- The Lumber Room
- The matroid union
- Theorem of the day
- Tim Gowers
- XKCD
Find me on the web
-
Join 664 other subscribers
Cameron Counts: RSS feeds
Meta
Tag Archives: Urysohn
History of the Random Graph
That wonderful object, the countable random graph, was first considered by Erdős and Rényi in their paper on “Asymmetric graphs” in 1963. After proving that a large random finite graph (edges chosen independently with probability 1/2) has (with high probability) … Continue reading
Posted in exposition, history
Tagged back-and-forth, Cantor, Erdos, Fraisse, homogeneous, Huntington, Rado, Renyi, universal, Urysohn
7 Comments
Peter Cameron's Blog 