/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
[Er75f] Erdős, Paul, On some problems of elementary and combinatorial geometry. Ann. Mat.
Pura Appl. (4) (1975), 99-108.
[Er76b] Erdős, P., Problems and results in graph theory and combinatorial analysis.
Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975)
(1976), 169-192.
[Er81] Erdős, P., On the combinatorial problems which I would most like to see solved.
Combinatorica (1981), 25-42.
[Er82e] Erdős, Paul, Some of my favourite problems which recently have been solved. (1982),
59--79.
[FrFu84b] Frankl, P. and Füredi, Z., On hypergraphs without two edges intersecting in a given
number of vertices. J. Combin. Theory Ser. A (1984), 230-236.
[Fr77b] Frankl, P., An intersection problem for finite sets. Acta Math. Acad. Sci. Hungar.
(1977), 371-373.
[FrRo87] Frankl, Peter and Rödl, Vojtech, Forbidden intersections. Trans. Amer. Math. Soc.
(1987), 259-286.
@[expose]publicsectionopenFinsetnamespaceErdos703
T n r is maximal such that there exists a family $\mathcal{F}$ of subsets of
${1,\ldots,n}$ of size T n r such that $\lvert A\cap B\rvert\neq r$ for all
$A,B\in \mathcal{F}$ (including $A=B$).
Let $r\geq 1$ and define $T(n,r)$ to be maximal such that there exists a family $\mathcal{F}$ of
subsets of ${1,\ldots,n}$ of size $T(n,r)$ such that $\lvert A\cap B\rvert\neq r$ for all
$A,B\in \mathcal{F}$.
Estimate $T(n,r)$ for $r\geq 2$. In particular, is it true that for every $\epsilon>0$ there
exists $\delta>0$ such that for all $\epsilon n<r<(1/2-\epsilon) n$ we have
$$T(n,r)<(2-\delta)^n?$$
The answer is yes, proved by Frankl and Rödl [FrRo87].
Frankl and Füredi [FrFu84b] proved that, for fixed $r$ and $n$ sufficiently large in terms of
$r$, the maximal $T(n,r)$ is achieved by taking
$$\mathcal{F} = \left{ A\subseteq {1,\ldots,n} : \lvert A\rvert> \frac{n+r}{2}\textrm{ or }
\lvert A\rvert < r\right}$$
when $n+r$ is odd, and
$$\mathcal{F} = \left{ A\subseteq {1,\ldots,n} : \lvert A\backslash {1}\rvert\geq
\frac{n+r}{2}\textrm{ or }\lvert A\rvert < r\right}$$
when $n+r$ is even.