26,478 research outputs found

    Uniform s-cross-intersecting families

    Full text link
    In this paper we study a question related to the classical Erd\H{o}s-Ko-Rado theorem, which states that any family of kk-element subsets of the set [n]={1,,n}[n] = \{1,\ldots,n\} in which any two sets intersect, has cardinality at most (n1k1){n-1\choose k-1}. We say that two non-empty families are A,B([n]k)\mathcal A, \mathcal B\subset {[n]\choose k} are {\it ss-cross-intersecting}, if for any AA,BBA\in\mathcal A,B\in \mathcal B we have ABs|A\cap B|\ge s. In this paper we determine the maximum of A+B|\mathcal A|+|\mathcal B| for all nn. This generalizes a result of Hilton and Milner, who determined the maximum of A+B|\mathcal A|+|\mathcal B| for nonempty 11-cross-intersecting families.Comment: This article was previously a portion of arXiv:1603.00938v1, which has been spli

    On the number of maximal intersecting k-uniform families and further applications of Tuza's set pair method

    Get PDF
    We study the function M(n,k)M(n,k) which denotes the number of maximal kk-uniform intersecting families F([n]k)F\subseteq \binom{[n]}{k}. Improving a bound of Balogh at al. on M(n,k)M(n,k), we determine the order of magnitude of logM(n,k)\log M(n,k) by proving that for any fixed kk, M(n,k)=nΘ((2kk))M(n,k) =n^{\Theta(\binom{2k}{k})} holds. Our proof is based on Tuza's set pair approach. The main idea is to bound the size of the largest possible point set of a cross-intersecting system. We also introduce and investigate some related functions and parameters.Comment: 11 page

    Cross-intersecting non-empty uniform subfamilies of hereditary families

    Get PDF
    A set AA tt-intersects a set BB if AA and BB have at least tt common elements. A set of sets is called a family. Two families A\mathcal{A} and B\mathcal{B} are cross-tt-intersecting if each set in A\mathcal{A} tt-intersects each set in B\mathcal{B}. A family H\mathcal{H} is hereditary if for each set AA in H\mathcal{H}, all the subsets of AA are in H\mathcal{H}. The rrth level of H\mathcal{H}, denoted by H(r)\mathcal{H}^{(r)}, is the family of rr-element sets in H\mathcal{H}. A set BB in H\mathcal{H} is a base of H\mathcal{H} if for each set AA in H\mathcal{H}, BB is not a proper subset of AA. Let μ(H)\mu(\mathcal{H}) denote the size of a smallest base of H\mathcal{H}. We show that for any integers tt, rr, and ss with 1trs1 \leq t \leq r \leq s, there exists an integer c(r,s,t)c(r,s,t) such that the following holds for any hereditary family H\mathcal{H} with μ(H)c(r,s,t)\mu(\mathcal{H}) \geq c(r,s,t). If A\mathcal{A} is a non-empty subfamily of H(r)\mathcal{H}^{(r)}, B\mathcal{B} is a non-empty subfamily of H(s)\mathcal{H}^{(s)}, A\mathcal{A} and B\mathcal{B} are cross-tt-intersecting, and A+B|\mathcal{A}| + |\mathcal{B}| is maximum under the given conditions, then for some set II in H\mathcal{H} with tIrt \leq |I| \leq r, either A={AH(r) ⁣:IA}\mathcal{A} = \{A \in \mathcal{H}^{(r)} \colon I \subseteq A\} and B={BH(s) ⁣:BIt}\mathcal{B} = \{B \in \mathcal{H}^{(s)} \colon |B \cap I| \geq t\}, or r=sr = s, t<It < |I|, A={AH(r) ⁣:AIt}\mathcal{A} = \{A \in \mathcal{H}^{(r)} \colon |A \cap I| \geq t\}, and B={BH(s) ⁣:IB}\mathcal{B} = \{B \in \mathcal{H}^{(s)} \colon I \subseteq B\}. This was conjectured by the author for t=1t=1 and generalizes well-known results for the case where H\mathcal{H} is a power set.Comment: 15 pages. arXiv admin note: text overlap with arXiv:1805.0524
    corecore