Skip to main content
SpringerLink
Log in

On a Degree Property of Cross-Intersecting Families

  • NOTE
  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Universität Bielefeld, Fakultät für Mathematik; Postfach 100131, 33501 Bielefeld, Germany; and Armenian National Academy of Sciences, Institute for Problems of Informatics and Automation; 375044 Yerevan, Armenia; E-mail: Gohar.Kyureghyan@Mathematik.Uni-Magdeburg.De, , , , , , AM

    Gohar M. M. Kyureghyan

Authors
  1. Gohar M. M. Kyureghyan
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930100008

Search

Navigation