Combinatorics-Cycles in sparse graphs

Speaker: Felix Lazebnik, University of Delaware
Date and time: Tuesday, April 17, 1-2pm
Place: Rome 771
Title: Cycles in sparse graphs

Abstract:There are several sufficient conditions for a graph on n vertices to contain a cycle of length k, and, in particular, to be Hamiltonian.  Often these conditions do not hold in sparse graphs, i.e., in graphs with the number of edges being o(n^2), as n goes to infinity.  In this talk we present several recent results on the existence of cycles of certain lengths (including Hamiltonian cycles) in some families of sparse graphs, and we state some open problems.