# Pairwise intersections and forbidden configurations

@inproceedings{Anstee2006PairwiseIA, title={Pairwise intersections and forbidden configurations}, author={Richard P. Anstee and Peter Keevash}, year={2006} }

- Published 2006
DOI:10.1016/i.ejc.2006.05.002

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). The asymptotic results are as m → ∞ for fixed non-negative integers a, b, c, d. This can be viewed as a result… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 14 CITATIONS

## Multivalued matrices and forbidden configurations

VIEW 5 EXCERPTS

CITES BACKGROUND

## Repeated Columns and an Old Chestnut

VIEW 6 EXCERPTS

CITES BACKGROUND

## Stability for the Complete Intersection Theorem, and the Forbidden Intersection Problem of Erd\H{o}s and S\'os

VIEW 4 EXCERPTS

CITES RESULTS

HIGHLY INFLUENCED

## Stability versions of Erd\H{o}s-Ko-Rado type theorems, via isoperimetry

VIEW 1 EXCERPT

CITES RESULTS

## Evidence for a forbidden configuration conjecture: One more case solved

VIEW 1 EXCERPT

CITES BACKGROUND

## Forbidden configurations and Steiner designs

VIEW 1 EXCERPT

CITES BACKGROUND