Tag Archives: affine planes

The Sylvester design

The Sylvester graph There is a distance-transitive graph on 36 vertices with valency 5 known as the Sylvester graph. The graph was first constructed by Norman Biggs and his co-authors in their work on small distance-transitive graphs. I asked Norman … Continue reading

Posted in exposition | Tagged , , | 5 Comments

ACCMCC, Days 4 and 5

Penny Haxell opened proceedings on Thursday with her astonishing work with Ron Aharoni. They give a sufficient condition for a tripartite 3-uniform hypergraph (one whose vertex set is partitioned into three parts so that each hyperedge contains one vertex from … Continue reading

Posted in events | Tagged , , , , , , | 1 Comment