The conjectured value of the minimum 44-clique density with bounded independence number

From papers

Let f(n,k,l)f(n,k,l) denote the minimum possible number of copies of KkK_k in an nn-vertex graph with independence number less than ll, and let ck,lc_{k,l} be the corresponding asymptotic minimum density. In particular, c4,4c_{4,4} concerns the minimum asymptotic density of 44-cliques in graphs with independence number less than 44.

Conjectured value of c4,4c_{4,4}.

c4,4=11+14×21/3192.c_{4,4}=\frac{-11+14\times 2^{1/3}}{192}.

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

No solutions have been posted yet.