A Turán type problem concerning the powers of the degrees of a graph

zbMath0986.05059arXivmath/0401398MaRDI QIDQ1583618

Yair Caro, Raphael Yuster

Publication date: 30 November 2000

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

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

zbMATH Keywords

degree sequenceTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (9)

The maximum outdegree power of complete \(k\)-partite oriented graphs ⋮ 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 ⋮ 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: A Turán type problem concerning the powers of the degrees of a graph