Events items teaser

A Closure Lemma for tough graphs and Hamiltonian degree conditions - Cléophée Robin
2023-03-20 15:00 (America/Toronto)
TITLE : A Closure Lemma for tough graphs and Hamiltonian degree
conditions

Speaker:
Cléophée Robin

Institution:
Wilfrid Laurier University

Location:
MC 5479

ABSTRACT: 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.
