Intersecting families in a subset of Boolean lattices (Q665759)

From MaRDI portal





scientific article; zbMATH DE number 6012341
Language Label Description Also known as
English
Intersecting families in a subset of Boolean lattices
scientific article; zbMATH DE number 6012341

    Statements

    Intersecting families in a subset of Boolean lattices (English)
    0 references
    0 references
    0 references
    6 March 2012
    0 references
    Summary: Let \(n\), \(r\) and \(\ell\) be distinct positive integers with \(r < \ell \leq n/2\), and let \(X_1\) and \(X_2\) be two disjoint sets, both of size \(n\). Define \[ \mathcal{F} = \{A \in \binom{X}{r+\ell}: |A \cap X_{1}| = r \text{ or }\ell\}, \] where \(X = X_{1} \cup X_2\). In this paper, we prove that if \(\mathcal{S}\) is an intersecting family in \(\mathcal{F}\), then \[ |\mathcal S| \leq \binom{n-1}{r-1} \binom{n}{\ell} + \binom{n-1}{\ell-1} \binom{n}{r}, \] and equality holds if and only if \(\mathcal{S} = \{A \in \mathcal{F} : a \in A \}\) for some \( a \in X\).
    0 references
    intersecting family
    0 references
    graded posets
    0 references
    Erdös-Ko-Rado theorem
    0 references

    Identifiers