Snarks - recent development
Presented by Prof. Martin SKOVIERA
Type: Oral presentation
Track: Keynote lecture
Snarks are nontrivial cubic graphs whose edges cannot be properly coloured with three colours. Since their first occurrence in the 19th century these graphs have been an object of continuous interest especially because of their relationship to various important problems in graph theory, such as the four colour problem, Tutte's 5-flow conjecture, the cycle double cover conjecture, and Fulkerson's conjecture. In spite of great research efforts, their structure and properties remain largely unknown. Our talk will survey recent development in this area by discussing various properties of snarks, in particular those related to their composite structure, perfect matchings, flows, edge-colourings, symmetries, embeddings, and others.