English

The Hajnal--Rothschild problem

Combinatorics 2025-02-11 v1 Discrete Mathematics

Abstract

For a family F\mathcal F define ν(F,t)\nu(\mathcal F,t) as the largest ss for which there exist A1,,AsFA_1,\ldots, A_{s}\in \mathcal F such that for iji\ne j we have AiAj<t|A_i\cap A_j|< t. What is the largest family F([n]k)\mathcal F\subset{[n]\choose k} with ν(F,t)s\nu(\mathcal F,t)\le s? This question goes back to a paper Hajnal and Rothschild from 1973. We show that, for some absolute CC and n>2k+Ct4/5s1/5(kt)log24nn>2k+Ct^{4/5}s^{1/5}(k-t)\log_2^4n, n>2k+Cs(kt)log24nn>2k+Cs(k-t)\log_2^4 n the largest family with ν(F,t)s\nu(\mathcal F,t)\le s has the following structure: there are sets X1,,XsX_1,\ldots, X_s of sizes t+2x1,,t+2xst+2x_1,\ldots, t+2x_s, such that for any AFA\in \mathcal F there is i[s]i\in [s] such that AXit+xi|A\cap X_i|\ge t+x_i. That is, the extremal constructions are unions of the extremal constructions in the Complete tt-Intersection Theorem. For the proof, we enhance the spread approximation technique of Zakharov and the second author. In particular, we introduce the idea of iterative spread approximation.

Keywords

Cite

@article{arxiv.2502.06699,
  title  = {The Hajnal--Rothschild problem},
  author = {Peter Frankl and Andrey Kupavskii},
  journal= {arXiv preprint arXiv:2502.06699},
  year   = {2025}
}
R2 v1 2026-06-28T21:38:55.812Z