Uniform s-Cross-Intersecting Families

From MaRDI portal
Publication:5366959



Abstract: In this paper we study a question related to the classical ErdH{o}s-Ko-Rado theorem, which states that any family of k-element subsets of the set [n]=1,ldots,n in which any two sets intersect, has cardinality at most n1choosek1. We say that two non-empty families are mathcalA,mathcalBsubset[n]choosek are {it s-cross-intersecting}, if for any AinmathcalA,BinmathcalB we have |AcapB|ges. In this paper we determine the maximum of |mathcalA|+|mathcalB| for all n. This generalizes a result of Hilton and Milner, who determined the maximum of |mathcalA|+|mathcalB| for nonempty 1-cross-intersecting families.











This page was built for publication: Uniform s-Cross-Intersecting Families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366959)