### Top Posts

### Recent comments

- Peter Cameron on Bad times
- Sam Stevenson on Bad times
- Joshua Paik on EDI
- The Quoter « Log24 on COP26
- Kathle Cameron on COP26

### 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

### Cameron Counts: RSS feeds

### Meta

# Tag Archives: Henson graphs

## Puzzle solution

Thank you, Honza, spot on. In 1964, Richard Rado published a construction of a universal graph, a countable graph which embeds every finite or countable graph as an induced subgraph. His graph turns out to be an explicit example of … Continue reading

Posted in exposition
Tagged countable random graph, Henson graphs, hereditarily finite set theory, Rado graph
Leave a comment

## BCC at Birmingham, days 1-3

This week I am in Birmingham for the British Combinatorial Conference. The organisation of the conference is outstanding. For one small example, yesterday, fifteen minutes before the Business Meeting was due to start, the Chairman noticed that we didn’t have … Continue reading

Posted in events
Tagged ADE diagrams, Henson graphs, independence polynomial, Ramsey theory, random permutations, skew Young tableaux
1 Comment