Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Monday, March 20, 2023 3:00 PM EDT
Title : A Closure Lemma for tough graphs and Hamiltonian degree conditions
Speaker: Cléophée Robin Institution: Wilfrid Laurier University Location: MC 5479Abstract: A graph G is hamiltonian if it exists a cycle in G containing all vertices of G exactly once. A graph G is t-tough if, ,for all subsets of vertices S, the number of connected components in G − S is at most |S| / t.