IMI Interdisciplinary Mathematics InstituteCollege of Arts and Sciences

Extremal problems for clique counting

  • Oct. 30, 2020
  • 2:30 p.m.

Abstract

Recently there has been progress on a number of questions concerning the maximal number of cliques that a graph can have, subject to a range of natural conditions. I’ll survey the history of the subject together with the recent progress. I’ll finish with some tentative indications of how things are different if we talk about cliques in hypergraphs.

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