Minimum Number of k-Cliques in Graphs with Bounded Independence Number
classification
🧮 math.CO
keywords
numberindependencek-cliquesminimumaskedboundedcasecases
pith:7VBLRP3L Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{7VBLRP3L}
Prints a linked pith:7VBLRP3L badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
Erdos asked in 1962 about the value of f(n,k,l), the minimum number of k-cliques in a graph of order n and independence number less than l. The case (k,l)=(3,3) was solved by Lorden. Here we solve the problem (for all large n) when (k,l) is (3,4), (3,5), (3,6), (3,7), (4,3), (5,3), (6,3), and (7,3). Independently, Das, Huang, Ma, Naves, and Sudakov did the cases (k,l)=(3,4) and (4,3).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.