On cross-intersecting families (Q1201261): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Contributions to the geometry of Hamming spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the size of a complex generated by an antichain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Katona theorem for cross t-intersecting families / rank
 
Normal rank

Latest revision as of 12:03, 17 May 2024

scientific article
Language Label Description Also known as
English
On cross-intersecting families
scientific article

    Statements

    On cross-intersecting families (English)
    0 references
    17 January 1993
    0 references
    Sharpening a result of \textit{A. Sali} [An Erdős-Ko-Rado theorem for posets, preprint] the following result is proved. Suppose that \(1\leq t\leq s\leq n\), \(X\) is an \(n\)-element set, \({\mathcal F}\), \({\mathcal G}\) are families of subsets of \(X\), if \(F\in{\mathcal F}\), \(G\in{\mathcal G}\) then \(| F\cap G|\geq t\), and finally, \(|{\mathcal G}|\leq|{\mathcal F}|\leq|{\mathcal F}(n,t)|\) holds where, if \(n+t\) is even, \({\mathcal F}(n,t)=\{F\subseteq X:| F|\geq(n+t)/2\}\), and if \(n+t\) is odd and \(x\in X\) is some element, then \({\mathcal F}(n,t)=\{F\subseteq X:| F\cap(X-\{x\})|\geq(n-1+t)/2\}\). Then, \(|{\mathcal F}|+|{\mathcal G}|\leq|{\mathcal F}(n,t)|+|{\mathcal F}(n,2s-t)|\).
    0 references
    cross-intersecting families
    0 references
    Katona's theorem
    0 references
    Erdős-Ko-Rado theorem
    0 references
    0 references

    Identifiers