Search arXivSearch

arXiv · 2502.06699

The Hajnal--Rothschild problem

Abstract

For a family $\mathcal F$ define $ν(\mathcal F,t)$ as the largest $s$ for which there exist $A_1,\ldots, A_{s}\in \mathcal F$ such that for $i\ne j$ we have $|A_i\cap A_j|< t$. What is the largest family $\mathcal F\subset{[n]\choose k}$ with $ν(\mathcal F,t)\le s$? This question goes back to a paper Hajnal and Rothschild from 1973. We show that, for some absolute $C$ and $n>2k+Ct^{4/5}s^{1/5}(k-t)\log_2^4n$, $n>2k+Cs(k-t)\log_2^4 n$ the largest family with $ν(\mathcal F,t)\le s$ has the following structure: there are sets $X_1,\ldots, X_s$ of sizes $t+2x_1,\ldots, t+2x_s$, such that for any $A\in \mathcal F$ there is $i\in [s]$ such that $|A\cap X_i|\ge t+x_i$. That is, the extremal constructions are unions of the extremal constructions in the Complete $t$-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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter Frankl, Andrey Kupavskii. 2025-02-10. The Hajnal--Rothschild problem. https://arxiv.org/abs/2502.06699

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO