On a degree property of cross-intersecting families

Motivated by some applications in computational complexity, Razborov and Ve reshchagin proved a degree bound for cross-intersecting families in [1]. We sharpen this result and show that our bound is best possible by constructi ng appropriate families. We also consider the case of cross-t-intersecting families.