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 , , , | 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 , , , , , | 1 Comment