A bound for 1-cross intersecting set pair systems

Abstract: A well-known result of Bollob'as says that if

{(A_{i}, B_{i})}_{i = 1}^{m}

is a set pair system such that

| A_{i} | l e a

and

| B_{i} | l e b

for

1 l e i l e m

, and

A_{i} c a p B_{j} e e m p t y s e t

if and only if

i e j

, then

m l e a + b c h o o s e a

. F"uredi, Gy'arf'as and Kir'aly recently initiated the study of such systems with the additional property that

| A_{i} c a p B_{j} | = 1

for all

i e j

. Confirming a conjecture of theirs, we show that this extra condition allows an improvement of the upper bound (at least) by a constant factor.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: A bound for 1-cross intersecting set pair systems