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.2723OpenAlexW2096807443MaRDI QIDQ744160
Shagnik Das, Humberto Naves, Jie Ma, Hao Huang, 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
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (17)
On the local structure of oriented graphs -- a case study in flag algebras ⋮ Independence number of graphs with a prescribed number of cliques ⋮ Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ Asymptotic Structure of Graphs with the Minimum Number of Triangles ⋮ Strong forms of stability from flag algebra calculations ⋮ On the maximum density of fixed strongly connected subtournaments ⋮ Minimum Number ofk-Cliques in Graphs with Bounded Independence Number ⋮ Semidefinite Programming and Ramsey Numbers ⋮ Counting flags in triangle-free digraphs ⋮ On the densities of cliques and independent sets in graphs ⋮ On the Maximum Quartet Distance between Phylogenetic Trees ⋮ Decomposing Graphs into Edges and Triangles ⋮ Minimum number of edges that occur in odd cycles ⋮ An improved lower bound for multicolor Ramsey numbers and a problem of Erdős ⋮ Compactness and finite forcibility of graphons ⋮ Inducibility of directed paths
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximum number of five-cycles in a triangle-free graph
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- On the number of pentagons in triangle-free graphs
- On the Minimum Number of k-Cliques in Graphs with Restricted Independence Number
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- Hypergraphs Do Jump
- On the Minimal Density of Triangles in Graphs
- Blue-Empty Chromatic Graphs
- Flag algebras
This page was built for publication: A problem of Erdős on the minimum number of \(k\)-cliques
