Degree Powers in Graphs: The Erdős–Stone Theorem

DOI10.1017/S0963548311000654zbMath1241.05021OpenAlexW2026653526MaRDI QIDQ2883853

Vladimir Nikiforov, Béla Bollobás

Publication date: 14 May 2012

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

Full work available at URL: https://doi.org/10.1017/s0963548311000654

zbMATH Keywords

Turan-type problem

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex degrees (05C07)

Related Items (8)

Entropy of weighted graphs with Randić weights ⋮ Degree-based entropies of networks revisited ⋮ Bounds for degree-based network entropies ⋮ Degree powers in graphs with a forbidden forest ⋮ Extremality of degree-based graph entropies ⋮ Degree powers in \(C_5\)-free graphs ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Degree powers in \(K_{s,t}\)-minor free graphs

Cites Work

• Joints in graphs
• Stability for large forbidden subgraphs
• Graphs with many r -cliques have large complete r -partite subgraphs

This page was built for publication: Degree Powers in Graphs: The Erdős–Stone Theorem