𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the football pool problem for 6 matches: A new upper bound

✍ Scribed by Ewald W Weber

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
126 KB
Volume
35
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A New Lower Bound for the Football Pool
A New Lower Bound for the Football Pool Problem for Six Matches
✍ Patric R.J. Γ–stergΓ₯rd; Alfred Wassermann πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 89 KB

In the football pool problem one wants to minimize the cardinality of a ternary code, C F n 3 ; with covering radius one, and the size of a minimum code is denoted by s n : The smallest unsettled case is 634s 6 473: The lower bound is here improved to 65 in a coordinate-by-coordinate backtrack searc

A Combinatorial Proof for the Football P
A Combinatorial Proof for the Football Pool Problem for Six Matches
✍ Patric R.J. Γ–stergΓ₯rd πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 171 KB

Consider the set F 6 3 of all 6-tuples x 0 x 1 x 2 x 3 x 4 x 5 with x i # [0, 1, 2]. It is known that there is a subset C of F 6 3 with 73 elements such that, for any x # F 6 3 , there is a word in C that differs from x in at most one coordinate. We show that there exists such a set C with a clear s

A new upper bound for the bipartite Rams
A new upper bound for the bipartite Ramsey problem
✍ David Conlon πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 89 KB πŸ‘ 1 views

## Abstract We consider the following question: how large does __n__ have to be to guarantee that in any two‐coloring of the edges of the complete graph __K__~__n,n__~ there is a monochromatic __K__~__k,k__~? In the late 1970s, Irving showed that it was sufficient, for __k__ large, that __n__ β‰₯ 2^_