Long cycles in 3-connected graphs with bounded degrees

Combinatorics Seminar
Friday, October 8, 2010 - 3:05pm
1 hour (actually 50 minutes)
Skiles 255
Department of Mathematics and Statistics, Georgia State University
In 1993 Jackson and Wormald conjectured that if G is a 3-connected n-vertex graph with maximum degree d \ge 4 then G has a cycle of length \Omega(n^{\log_{d-1} 2}). In this talk, I will report progresses on this conjecture and related problems.