On a Degree Property of Cross-Intersecting Families

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

This is a preview of subscription content, access via your institution.

Author information



Additional information

Received October 28, 1999

Rights and permissions

Reprints and Permissions

About this article

Cite this article

M. Kyureghyan, G. On a Degree Property of Cross-Intersecting Families. Combinatorica 21, 449–453 (2001). https://doi.org/10.1007/s004930100008

Download citation

  • AMS Subject Classification (1991) Classes:  05D05, 68R05