Hilton–Milner codegree-squared-sum conjecture for intersecting families

Let [n]={1,,n}[n]=\{1,\ldots,n\}, let ([n]k)\binom{[n]}{k} denote the family of kk-subsets of [n][n], and let F([n]k)\mathcal{F}\subset\binom{[n]}{k} be a nontrivial intersecting family, meaning that every two members intersect and the family is not contained in a 11-star. Let H(n,k,1)\mathcal{H}(n,k,1) be the Hilton–Milner family, and let A(n,3,1)\mathcal{A}(n,3,1) be the other extremal family appearing in the k=3k=3 case.

Hilton–Milner codegree-squared-sum conjecture. For k3k\ge3 and n>2kn>2k,

co2(F)co2(H(n,k,1)).\operatorname{co}_2(\mathcal{F})\le\operatorname{co}_2(\mathcal{H}(n,k,1)).

For k4k\ge4, equality holds if and only if F\mathcal{F} is isomorphic to H(n,k,1)\mathcal{H}(n,k,1); for k=3k=3, equality holds if and only if F\mathcal{F} is isomorphic to H(n,3,1)\mathcal{H}(n,3,1) or to A(n,3,1)\mathcal{A}(n,3,1). The paper notes that the k=3k=3 equality of the two candidate families can be checked directly, while the general Hilton–Milner-type result remains open.

Sources & referencesView supporting material

Primary source

George Brooks and William Linz, “Some exact and asymptotic results for hypergraph Turán problems in _2-norm”, arXiv:2310.09379 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.