Papers
Topics
Authors
Recent
Search
2000 character limit reached

An Erdős--Ko--Rado theorem for cross-intersecting families in the Euclidean inner product

Published 18 Aug 2026 in math.CO | (2608.17219v1)

Abstract: Let ([n]k)\binom{[n]}{k} be the set of all kk-element subsets of the set 1,…,n{1,\ldots,n} and let A,B⊆([n]k)\mathcal A,\mathcal B \subseteq \binom{[n]}{k} be two cross-intersecting families, that is, A∩B≠∅A\cap B\neq \emptyset for any A∈AA\in \mathcal A and B∈BB\in \mathcal B. The classical cross-intersecting version of the Erdős--Ko--Rado theorem, due to Pyber and Matsumoto--Tokushige, states that if n≥2kn\geq 2k, then ∣A∣∣B∣≤(n−1k−1)<sup>2,|\mathcal A||\mathcal B|\leq \binom{n-1}{k-1}<sup>2, where the equality holds for $n&gt;2k$ if and only if A=B\mathcal A=\mathcal B is a star. In the present paper, we first give a stability result of this theorem by using Filmus's FKN theorem on the slice and linear algebra method as follows: There exists a constant $C&gt;1$ such that if n≥2.07kn\geq 2.07k and ∣A∣∣B∣≥(1−ε)(n−1k−1)<sup>2|\mathcal A||\mathcal B|\geq (1-ε)\binom{n-1}{k-1}<sup>2, where ε≤k<sup>2C<sup>2</sup></sup>n<sup>2</sup>ε\leq \frac{k<sup>2}{C<sup>2</sup></sup> n <sup>2</sup> }, then there is a star S\mathcal{S} such that ∣SΔA∣≤Cε(nk)|\mathcal{S} Δ\mathcal A|\leq C ε\binom{n}{k} and ∣SΔB∣≤Cε(nk).|\mathcal{S} Δ\mathcal B|\leq C ε\binom{n}{k}. Moreover, based on this stability result and the eigenvalues of the matrices of the Johnson scheme, we present an Erdős--Ko--Rado theorem for cross-intersecting families in the Euclidean inner product showing that if n≥2kn\geq 2k and k≥d≥0k\geq d \geq 0, then ⟨vd(A),vd(B)⟩≤(kd)(k−1d)(n−1d)(n−1k−1)<sup>2</sup>+(k−1d−1)(n−d−1k−d)(n−1k−1),\big\langle\mathbf{v}_d(\mathcal A),\mathbf{v}_d(\mathcal B)\big\rangle \leq \frac{\binom{k}{d}\binom{k-1}{d}}{\binom{n-1}{d}}\binom{n-1}{k-1}<sup>2</sup> +\binom{k-1}{d-1} \binom{n-d-1}{k-d}\binom{n-1}{k-1}, together with uniqueness and a corresponding stability result, where vd(A)∈R<sup>([n]d)\mathbf{v}_d(\mathcal A) \in \mathbb R<sup>{\binom{[n]}{d}} is the dd-degree vector of A\mathcal A whose UU-entry is the number of members in A\mathcal A containing UU.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.