Degree Power Sums in Extremal Set Systems
arXiv:2607.28616
Abstract
For a family and , let and ; write for the codegree power sum. We introduce a method that uses convexity to extend sharp bounds for degree sums and sums of squared degrees to real powers, while retaining all equality cases. The method bounds by quadratic polynomials or by a continuous function that is linear on each of two intervals. These functions agree with at the degrees of the proposed extremal family, so the argument requires no bounds for sums of higher powers. For families with bounded matching number, we instead use a bound for together with the degree sum. We give three exact applications. First, a full -star maximizes among -intersecting families for every real in the sharp range , with all equality cases determined. This extends the quadratic theorem of Wu and Zhang to real exponents and answers a problem of Zhou and Yuan throughout the sharp Erdős--Ko--Rado range. Second, among intersecting families with , a full star maximizes for every and real , again with all equality cases determined. Third, if and , then for every real , is uniquely maximized, up to permutation, by all -sets meeting a fixed -set. This removes the integrality restriction on and replaces previous cubic thresholds or assumptions that is sufficiently large with an explicit linear range valid for arbitrary .