An upper bound on the sum of squares of degrees in a hypergraph

DOI10.1016/S0012-365X(03)00130-4zbMath1024.05043OpenAlexW1996128431MaRDI QIDQ1402082

Christian Bey

Publication date: 19 August 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00130-4

zbMATH Keywords

hypergraphdegree sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Vertex degrees (05C07)

Related Items (15)

A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications ⋮ On degree sums of a triangle-free graph ⋮ Noise sensitivity in continuum percolation ⋮ An upper bound on the sum of powers of the degrees of simple 1-planar graphs ⋮ Upper bounds on the sum of powers of the degrees of a simple planar graph ⋮ The sum of the squares of degrees: sharp asymptotics ⋮ Extremality of degree-based graph entropies ⋮ Partially Observed Boolean Sequences and Noise Sensitivity ⋮ Upper bound on the sum of powers of the degrees of graphs with few crossings per edge ⋮ Sums of powers of the degrees of a graph ⋮ Lagrangians of hypergraphs. II: When colex is best ⋮ Extremal Trees with Respect to Some Versions of Zagreb Indices Via Majorization ⋮ Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false ⋮ Degree powers in \(K_{s,t}\)-minor free graphs ⋮ ON THE SUM OF POWERS OF THE DEGREES OF GRAPHS

Cites Work

• An upper bound on the sum of squares of degrees in a graph
• Polynomial LYM inequalities
• Unnamed Item
• Unnamed Item

This page was built for publication: An upper bound on the sum of squares of degrees in a hypergraph