Presented by: 
Darryn Bryant, UQ
Tue 21 Apr, 3:00 pm - 4:00 pm
Building 67, Room 442

A famous open conjecture of Lovász from 1970 links the seemingly unrelated graph properties of traversability and symmetry, and a number of problems of this kind have attracted interest in the intervening years. I will give an overview of the area, explaining the necessary concepts, and discuss recent work with Matt Dean in which we show that there are infinitely many connected vertex-transitive graphs that have no Hamilton decomposition.