On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6 (Q1872896)

If \(k_t(n)\) is the minimal number of \(t\)-cliques in an \(n\) vertex graph plus its complement, \(c_t=\lim_{n\to\infty} k_t(n) / {n \choose t}\), the bounds \(c_5< 0.885834\cdot 2^{-9}\), \(c_6<0.744514\cdot 2^{-14}\), obtained by computer calculations, are announced. The idea of the constructions goes back to \textit{F. Franek} and \textit{V. Rödl} [Discrete Math. 114, 199-203 (1993; Zbl 0782.05059)].