Tag Archives: packing and covering

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