The Random Graph Revisited

2001/01/01 by Peter J‎. Cameron · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Advanced Graph Theory Research #Butterfly graph #Combinatorics #Complex Network Analysis Techniques #Complexity and Algorithms in Graphs #Computer science #Countable set #Discrete mathematics #Graph #Homogeneous #Line graph #Mathematics #Null graph #Random graph #Voltage graph

paper · doi:10.1007/978-3-0348-8268-2_15

openalex publication_date 2001/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Abstract

The random graph, or Rado’s graph (the unique countable homogeneous graph) has made an appearance in many parts of mathematics since its first occurrences in the early 1960s. In this paper I will discuss some old and new results on this remarkable structure. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Citations

• Universal graphs and universal functions
• Normal hypergraphs and the perfect graph conjecture
• Countable homogeneous relational structures and ℵ0-categorical theories
• Asymmetric graphs
• A family of countable homogeneous graphs
• Tournaments and Orders with the Pigeonhole Property
• The group of the countable universal graph

Cited by

• Rado graph [wikipedia]