On the Minimum Number of k-Cliques in Graphs with Restricted Independence Number
From MaRDI portal
Publication:2757078
DOI10.1017/S0963548301004722zbMath0988.05072OpenAlexW2068402891MaRDI QIDQ2757078
Publication date: 22 July 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548301004722
Related Items (4)
Independence number of graphs with a prescribed number of cliques ⋮ Strong forms of stability from flag algebra calculations ⋮ A problem of Erdős on the minimum number of \(k\)-cliques ⋮ An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
This page was built for publication: On the Minimum Number of k-Cliques in Graphs with Restricted Independence Number