Minimum Number ofk-Cliques in Graphs with Bounded Independence Number

DOI10.1017/S0963548313000357zbMath1282.05183arXiv1203.4393MaRDI QIDQ5397739

Emil R. Vaughan, Oleg Pikhurko

Publication date: 24 February 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.4393

zbMATH Keywords

extremal Ramsey graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (22)

Finitely forcible graph limits are universal ⋮ Rainbow triangles in three-colored graphs ⋮ On the local structure of oriented graphs -- a case study in flag algebras ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ 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 ⋮ Finitely forcible graphons with an almost arbitrary structure ⋮ Strong forms of stability from flag algebra calculations ⋮ Finitely forcible graphons and permutons ⋮ On the maximum density of fixed strongly connected subtournaments ⋮ On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament ⋮ Counting flags in triangle-free digraphs ⋮ On the densities of cliques and independent sets in graphs ⋮ On the Maximum Quartet Distance between Phylogenetic Trees ⋮ Minimum number of edges that occur in odd cycles ⋮ Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal ⋮ Closing in on Hill's Conjecture ⋮ Weak regularity and finitely forcible graph limits ⋮ An improved lower bound for multicolor Ramsey numbers and a problem of Erdős ⋮ Compactness and finite forcibility of graphons

Cites Work

• Unnamed Item
• Monochromatic triangles in three-coloured graphs
• A problem of Erdős on the minimum number of \(k\)-cliques
• On the number of pentagons in triangle-free graphs
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Hypergraphs Do Jump
• On Sets of Acquaintances and Strangers at any Party
• Blue-Empty Chromatic Graphs
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• Flag algebras
• On the maximal triangle-free edge-chromatic graphs in three colors
• Efficient testing of large graphs

This page was built for publication: Minimum Number ofk-Cliques in Graphs with Bounded Independence Number