On the densities of cliques and independent sets in graphs

DOI10.1007/s00493-015-3051-9zbMath1399.05125arXiv1211.4532OpenAlexW1534610882MaRDI QIDQ5915866

Benjamin Sudakov, Hao Huang, Humberto Naves, Nati Linialy, Yuval Peled

Publication date: 22 February 2018

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

coloring\(K_n\) graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Inducibility and universality for trees ⋮ A note on the inducibility of 4-vertex graphs ⋮ Disjoint pairs in set systems with restricted intersection ⋮ The feasible region for consecutive patterns of permutations is a cycle polytope

Cites Work

• Two-colorings with many monochromatic cliques in both colors
• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• A problem of Erdős on the minimum number of \(k\)-cliques
• Shadows and intersections: Stability and new proofs
• The number of cliques in graphs of given order and size
• On Sets of Acquaintances and Strangers at any Party
• On the Minimal Density of Triangles in Graphs
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• On the structure of linear graphs
• On packing densities of permutations

This page was built for publication: On the densities of cliques and independent sets in graphs