Tag Archives: Sebi Cioaba

A small fact about the Petersen graph

Posted on 02/05/2017 by Peter Cameron

The Petersen graph has 10 vertices and 15 edges, and the complete graph on 10 vertices has 45 edges. However, Allen Schwenk and (independently) O. P. Lossers (Jack van Lint’s problem-solving seminar in Eindhoven) showed that you can’t partition the … Continue reading →

Posted in open problems | Tagged , , | 4 Comments

Peter Keevash at IMS

Posted on 29/05/2016 by Peter Cameron

This picture (courtesy of Sebi Cioabă) shows Peter Keevash with the diagram which illustrates the proof strategy for his theorem. Perhaps it will be helpful, especially to those who heard the lecture (or similar lectures elsewhere). Thanks Sebi!

Posted in exposition | Tagged , | Leave a comment