Skip to main content
SpringerLink
Log in

The Erdős–Ko–Rado Theorem for Integer Sequences

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

n

, q, t we determine the maximum number of integer sequences which satisfy for , and any two sequences agree in at least t positions. The result gives an affirmative answer to a conjecture of Frankl and Füredi.

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. CNRS, ER 175 Combinatoire; 54 Bd Raspail, 75006 Paris, France, , , , , , FR

    Peter Frankl

  2. College of Education, Ryukyu University; Nishihara, Okinawa, 903-0213, Japan; E-mail: hide@edu.u-ryukyu.ac.jp, , , , , , JP

    Norihide Tokushige

Authors
  1. Peter Frankl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Norihide Tokushige
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: January 26, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Frankl, P., Tokushige, N. The Erdős–Ko–Rado Theorem for Integer Sequences. Combinatorica 19, 55–63 (1999). https://doi.org/10.1007/s004930050045

Download citation

  • Issue Date:

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

Search

Navigation