Graphs with many r -cliques have large complete r -partite subgraphs
From MaRDI portal
Publication:5459244
DOI10.1112/blms/bdm093zbMath1145.05030arXivmath/0703554OpenAlexW3106089230MaRDI QIDQ5459244
Publication date: 25 April 2008
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0703554
Related Items (16)
Degree Powers in Graphs: The Erdős–Stone Theorem ⋮ On the density of a graph and its blowup ⋮ Some extremal problems for hereditary properties of graphs ⋮ Ramsey non-goodness involving books ⋮ On a topological version of Pach's overlap theorem ⋮ Two Erdős-Hajnal-type theorems in hypergraphs ⋮ Blowup Ramsey numbers ⋮ A Spectral Erdős–Stone–Bollobás Theorem ⋮ Unavoidable patterns ⋮ The number of graphs with large forbidden subgraphs ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Stability for large forbidden subgraphs ⋮ Complete \(r\)-partite subgraphs of dense \(r\)-graphs ⋮ Turán's theorem inverted ⋮ Complete Partite subgraphs in dense hypergraphs ⋮ Supersaturation for subgraph counts
This page was built for publication: Graphs with many r -cliques have large complete r -partite subgraphs
