IMI Interdisciplinary Mathematics InstituteCollege of Arts and Sciences

An extension of Erdos-Gallai theorem

  • Nov. 5, 2019
  • 1:30 p.m.


The celebrated Erdos-Gallai theorem states that each graph contains a path of length at least the average degree. In this talk, we will introduce a clique version of the Erdos-Gallai theorem. Moreover, we will show its applications to generalized Turan problems and a problem on the consecutive length of cycles in graphs. Joint work with Bo Ning.

© Interdisciplinary Mathematics Institute | The University of South Carolina Board of Trustees | Webmaster