Richard P. Anstee ; Peter Keevash
-
Pairwise Intersections and Forbidden Configurations
dmtcs:3426 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2005,
DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
-
https://doi.org/10.46298/dmtcs.3426
Pairwise Intersections and Forbidden ConfigurationsConference paper
Authors: Richard P. Anstee 1; Peter Keevash 2
NULL##NULL
Richard P. Anstee;Peter Keevash
1 Department of Mathematics [Vancouver]
2 Department of Applied & Computational Mathematics
Let fm(a,b,c,d) denote the maximum size of a family F of subsets of an m-element set for which there is no pair of subsets A,B∈F with |A∩B|≥a, |ˉA∩B|≥b, |A∩ˉB|≥c, and |ˉA∩ˉB|≥d. By symmetry we can assume a≥d and b≥c. We show that fm(a,b,c,d) is Θ(ma+b−1) if either b>c or a,b≥1. We also show that fm(0,b,b,0) is Θ(mb) and fm(a,0,0,d) is Θ(ma). This can be viewed as a result concerning forbidden configurations and is further evidence for a conjecture of Anstee and Sali. Our key tool is a strong stability version of the Complete Intersection Theorem of Ahlswede and Khachatrian, which is of independent interest.