Degree powers in graphs with forbidden subgraphs

zbMath1057.05045arXivmath/0405001MaRDI QIDQ1883656

Béla Bollobás, Vladimir Nikiforov

Publication date: 13 October 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Turán graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (10)

Degree-based entropies of networks revisited ⋮ Degree powers of graphs without \(B_{\ell,s}\) ⋮ Maximizing the degree powers of graphs with fixed size ⋮ Degree powers in graphs with a forbidden forest ⋮ Extremality of degree-based graph entropies ⋮ The minimum degree distance of graphs of given order and size ⋮ Degree powers in \(C_5\)-free graphs ⋮ Number of walks and degree powers in a graph ⋮ Degree powers in \(K_{s,t}\)-minor free graphs ⋮ Supersaturation for subgraph counts

This page was built for publication: Degree powers in graphs with forbidden subgraphs