Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
Time and Date:3:00 pm, Thu, 2nd Aug 2012
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.