Tag Archives: Dale Mesner

The prehistory of the Higman-Sims graph

Triangle-free strongly regular graphs form a fascinating byway of combinatorics. These are regular graphs of valency k on v vertices, which contain no triangles, and have the property that any two non-adjacent vertices have μ common neighbours. The numbers (v,k,μ) … Continue reading

Posted in exposition, history | Tagged , , , | 1 Comment