SEMINAR: Groups and Combinatorics Seminar: Daniel Harvey, 4pm Friday 11 May 2018 in Weatherburn LT

Speaker: Daniel Harvey (University of Western Australia)

Title: A cycle of maximum order in a graph of high minimum degree has a chord

Time and place: 4pm 11 May 2018, Weatherburn LT

Abstract: A long standing conjecture of Thomassen states that every cycle of maximum order in a 3-connected graph contains a chord. While many partial results towards this conjecture have been obtained, the conjecture itself remains unsolved. In this talk, we shall discuss a result for graphs of high minimum degree, which shows Thomassen's conjecture holds in that case. This result holds for all graphs with high minimum degree, rather than just 3-connected graphs, and this result is within a constant factor of best possible when no assumption is made on the connectivity.

Past and future seminars may be found at http://www.maths.uwa.edu.au/~glasby/GroupsAndCombinatoricsSeminar/S18.html

There will be cake in the Mathematics and Statistics tea room at 15:40. The seminar starts at 16:00, and after 17:05 we go to the UniClub for a drink.

All welcome.