A cross‐intersection theorem for subsets of a set

From MaRDI portal
Publication:5245489



Abstract: Two families mathcalA and mathcalB of sets are said to be cross-intersecting if each member of mathcalA intersects each member of mathcalB. For any two integers n and k with 0leqkleqn, let [n]chooseleqk denote the family of all subsets of 1,dots,n of size at most k. We show that if mathcalAsubseteq[m]chooseleqr, mathcalBsubseteq[n]chooseleqs, and mathcalA and mathcalB are cross-intersecting, then [|mathcal{A}||mathcal{B}| leq sum_{i=0}^r {m-1 choose i-1} sum_{j=0}^s {n-1 choose j-1},] and equality holds if mathcalA=Ain[m]chooseleqrcolon1inA and mathcalB=Bin[n]chooseleqscolon1inB. Also, we generalise this to any number of such cross-intersecting families.




Cites work









This page was built for publication: A cross‐intersection theorem for subsets of a set

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