A problem of Erdős on the minimum number of \(k\)-cliques
From MaRDI portal
Publication:744160
DOI10.1016/j.jctb.2013.02.003zbMath1301.05185arXiv1203.2723MaRDI QIDQ744160
Jie Ma, Hao Huang, Shagnik Das, Humberto Naves, Benjamin Sudakov
Publication date: 6 October 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.2723
05C35: Extremal problems in graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
