paper

Robust Repulsion for Growing Crowns in Linear Hypergraphs

arXiv:2608.01568

Abstract

Put , , and . For an edge of a linear -free -uniform hypergraph, define \[ δ_H(e)=\sum_{v\in e}\frac{1}{d_H(v)}-\frac{r}{D}. \] The defect satisfies . At equality, every vertex of has degree , and the petal trace at is a disjoint union of affine planes of order . Equivalently, restoring the base line gives projective planes of order with common line . For growing crowns, the equality structure is stable in the following sense. If , , and is an edge of a finite linear -free hypergraph satisfying \[ \frac{t_j^2}{q_j}\to0, \qquad t_j^3δ_{H_j}(e_j)\to0, \] then, for every fixed , \[ \frac{ |\{f\ne e_j:f\cap e_j\ne\varnothing,\ δ_{H_j}(f)\geθ/t_j^2\}| }{(q_j+1)(t_jq_j)} \to1. \] Thus an edge close to equality is adjacent almost entirely to edges with defect of order at least . A uniform form gives absolute constants such that, whenever and , at least neighbors of have defect at least . Consequently, \[ c^{\mathrm{lin}}_{q+1,t+1}\le t-\frac{c_0}{t}, \] where denotes the asymptotic linear Turán coefficient for .

16 pages

Robust Repulsion for Growing Crowns in Linear Hypergraphs · wovepaper