Abstract
AbstractIn this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Turán-type result is an extension of the celebrated Erdős 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.
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have