The football pool problem for 5 matches

H.J.L. Kamps, J.H. van Lint

Research output: Contribution to journalArticleAcademicpeer-review

42 Citations (Scopus)
127 Downloads (Pure)


We consider the set of all 5-tuples x=(x1, x2, x3, x4, x5) with xi=0,1 or 2 for i=1…,5. The problem treated in this paper is determining the minimal k for which a set of 5-tuples exists such that for each x in there is an element in that differs from x in at most one coordinate.
Original languageEnglish
Pages (from-to)315-325
JournalJournal of Combinatorial Theory
Issue number4
Publication statusPublished - 1967

Cite this