Pairwise intersections and forbidden configurations (Q850074): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Richard P. Anstee / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Péter L. Erdős / rank
 
Normal rank

Revision as of 21:44, 10 February 2024

scientific article
Language Label Description Also known as
English
Pairwise intersections and forbidden configurations
scientific article

    Statements

    Pairwise intersections and forbidden configurations (English)
    0 references
    0 references
    0 references
    15 November 2006
    0 references
    This interesting paper proves at first a strong stability version of the celebrated complete intersection theorem of Ahlswede and Khachatrian in the spirit of the Hilton-Milner theorem. Then using it the authors prove the following result: let \(f_m(a,b,c,d)\) denote the maximum size of a family of an \(m\)-element underlying set with the property that for all pairs \(A,B\) we have \(| A \cap B| \geq a,\) \(| \overline{A} \cap B| \geq b,\) \(| A \cap \overline{B}| \geq c\) and \(| \overline{A} \cap \overline{B}| \geq d.\) Then \(f_m(a,b,c,d) = \Theta( m^{a+b-1})\) for a wide range of the parameters.
    0 references
    0 references
    Erdős-Ko-Rado theorem
    0 references
    Complete Intersection Theorem
    0 references
    conjecture of Anstee and Sali
    0 references