Spectral complete-intersection conjecture for t-intersecting uniform families
Establish that, for every pair of integers satisfying 1≤t≤k and n>2k−t, at least one Frankl family _r={F∈([n] choose k): |F∩[t+2r]|≥t+r}, with 0≤r≤k−t, has spectral radius equal to the maximum adjacency-tensor spectral radius among all t-intersecting subfamilies of ([n] choose k); equivalently, prove that every such family satisfies ρ()≤max_{0≤r≤k−t}ρ(_r).
References
For general t, the natural next statement is that the list of Frankl families always contains a spectral extremal structure.
— A Sharp Spectral Erdős--Ko--Rado Theorem for Uniform Hypergraphs
(2608.24440 - Cao et al., 25 Aug 2026) in Section 6, 'The spectral complete-intersection conjecture'; Conjecture 6.1