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 →