The maximum number of cliques in graphs with bounded odd circumference
Abstract
In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Tur\'an-type result is an extension of the celebrated Erdos and Gallai theorem and a strengthening of Luo's recent result. The same bound for graphs with bounded even circumferences is a trivial application of the theorem of Li and Ning.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.