CARMA Discrete Mathematics Instructional Seminar

3:00 pm

Thursday, 26th Jul 2012

V129, Mathematics Building

Prof. Brian Alspach

(CARMA, The University of Newcastle)

The elusive snark

Snarks are 3-regular graphs that are not 3-edge-colourable and are cyclically 4-edge-connected. They exist but are hard to find. On the other hand, it is believed that Cayley graphs can never be snarks. The latter is the subject of the next series of talks.