The conjectured value of the minimum -clique density with bounded independence number
The conjectured value of the minimum -clique density with bounded independence number
Let denote the minimum possible number of copies of in an -vertex graph with independence number less than , and let be the corresponding asymptotic minimum density. In particular, concerns the minimum asymptotic density of -cliques in graphs with independence number less than .
Conjectured value of .
The value is proposed as a promising case for the approach developed in the paper; the preceding discussion notes that analogous numerical predictions for other parameter pairs are made rigorous here, while this case remains conjectural.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Oleg Pikhurko and Emil R. Vaughan, “Minimum Number of k-Cliques in Graphs with Bounded Independence Number”, arXiv:1203.4393 (2013).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.