The Hajnal--Rothschild problem
Combinatorics
2025-02-11 v1 Discrete Mathematics
Abstract
For a family define as the largest for which there exist such that for we have . What is the largest family with ? This question goes back to a paper Hajnal and Rothschild from 1973. We show that, for some absolute and , the largest family with has the following structure: there are sets of sizes , such that for any there is such that . That is, the extremal constructions are unions of the extremal constructions in the Complete -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}
}