Anticlusters and intersecting families of subsets
A family \({\mathcal A}\subseteq 2^{[n]}\), \([n]=\{1,2,...,n\}\), is said to be an intersecting family of a family \({\mathcal B}\subseteq 2^{[n]}\) if for any F, \(F'\in {\mathcal A}\) there is \(B\in {\mathcal B}\) such that \(B\subseteq F\cap F'\). In the paper it is shown that if \({\mathcal B}\) consists of all translates of a set \(X\subseteq [n]\) then the maximum size of an intersecting family over \({\mathcal B}\) equals \(2^{n-| X|}\). This proves a special case of a conjecture of \textit{F. Chung, P. Frankl, R. Graham} and \textit{J. Shearer} [ibid. 43, 23-37 (1986; Zbl 0655.05001)].
- Families intersecting on an interval
- 1-intersecting families
- Beyond the Erdős-Ko-Rado theorem
- On the number of group-weighted matchings
- Intersecting set systems and graphic matroids
- Representations of families of triples over GF(2)
- Maximal intersecting families
- Intersecting P-free families
- Some exact results for multiply intersecting families
- Triangle-intersecting families of graphs
- Families of sets with intersecting clusters
- scientific article; zbMATH DE number 54776 (Why is no real title available?)
- INTERSECTING AND NON-UNION ANTICHAINS
- Intersecting balanced families of sets
This page was built for publication: Anticlusters and intersecting families of subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641301)
