Open AccessThe Erdős-Ko-Rado Theorem for Integer Sequences
Author(s) -
Péter Frankl,
Norihide Tokushige
Publication year - 1999
Publication title -
combinatorica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.106
H-Index - 58
eISSN - 1439-6912
pISSN - 0209-9683
DOI - 10.1007/s004930050045
Subject(s) - mathematics , conjecture , combinatorics , integer (computer science) , discrete mathematics , programming language , computer science
For positive integers n,q,t we determine the maximum number of integer sequences (a1,...,an) which satisfy 1 ai q for 1 i n, and any two sequences agree in at least t positions. The result gives an armative answer to a conjecture of Frankl and Furedi.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom