📝 SummarXiv

Abstract

Let ${\mathcal F}$ be a family of subsets of a finite set $X$. A subfamily of ${\mathcal F}$ is intersecting if any two members of ${\mathcal F}$ has nonempty intersection. We say ${\mathcal F}$ has the EKR property, if, for any fixed element of $X$ the subfamily of all sets in $\mathcal{F}$ that contain $x$ is an intersecting subfamily of $\mathcal{F}$ of possible maximum size. We say ${\mathcal F}$ has the strong EKR property (the strong EKR property), if every intersecting subfamily of $\mathcal{F}$ of maximum size is of the form consisting of all members that contain a fixed element of $X$. In this paper, we introduce a general compositional framework for proving the EKR property and the strong EKR property for certain set systems. Our approach is based on a composition lemma, which we develop and explain in detail. To demonstrate the effectiveness of this tool, we present simple proofs of several previously known results in the field. As an application, we show that for every fixed $r$-uniform hypergraph $H$ and all sufficiently large integers $n$, the family of all subhypergraphs of the complete $r$-uniform hypergraph on $n$ vertices that are isomorphic to $H$ satisfies the strong EKR property, where two copies of $H$ are considered intersecting if they share at least one common hyperedge. This result provides a notable generalization of the earlier work of Meagher and Moura, Kamat and Misra, and of Borg and Meagher on the strong EKR property for perfect machings and $k$-matchings in complete graphs. We establish an explicit linear bound in $k$ on the number of vertices of complete and complete bipartite graphs such that the family of $k$-cycles in $K_n$ and $K_{n,n}$ satisfies the EKR and strong EKR properties.