Inequalities relating degrees of adjacent vertices to the average degree. (English) Zbl 0624.05048

By a hypergraph with a fixed number of vertices (per edge), say n, the authors understand a matrix of non-negative integers with constant row sum n; they allow vertices to occur more than once in an edge. The authors prove a theorem from which they draw four corollaries. One of them states that the geometric degree of the vertices is not less than the arithmetic degree. Another corollary relates the number of edge, the number of vertices, and the largest number of triangles based on a fixed edge.
Reviewer: L.Zaremba


05C65 Hypergraphs


Full Text: DOI


[1] Bollobás, B., Extremal graph theory, (1978), Academic Press London · Zbl 0419.05031
[2] Hardy, Littlewood and polya, (1934), Inequalities Cambridge University Press
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.