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

Discrete Mathematics

Volumn 269, Issue 1-3, 2003, Pages 259-263

  Bey, Christian ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Degree sequence; Hypergraph

Indexed keywords

FUNCTIONS; MATHEMATICAL MODELS; SET THEORY;

HYPERGRAPHS;

GRAPH THEORY;

EID: 0038141206     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00130-4     Document Type: Article

References (4)

1. Anderson I. Combinatorics of Finite Sets. 1987;Clarendon Press, Oxford.
2. C. Bey, Polynomial LYM-inequalities, submitted for publication.
3. de Caen D. An upper bound on the sum of squares of degrees in a graph. Discrete Math. 185:1998;245-248.
4. Delsarte P. An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10:1973.