Snarks -- and beyond?
Presented by Gunnar BRINKMANN
Type: Keynote Lecture
In this talk I will sketch an algorithm to generate Snarks -- that is cubic cyclically 4-connected graphs with chromatic index 4. Snarks are especially interesting as for several conjectures it can be shown that if they wrong, the smallest counterexample is a Snark. I will also give some examples of conjectures that were refuted with the lists generated by the algorithm. As we are now able to generate very large sets of snarks, the question arises whether it is possible to further restrict the class and still keep the property that the class contains smallest possible counterexamples for a lot of conjectures. This is joint work with Jan Goedgebeur, Jonas Hägglund and Klas Markström.
Location: Portorož, Slovenia
Address: University of Primorska, Faculty of Tourism Studies, Obala 11a, SI-6320 Portorož - Portorose, Slovenia