Lower bounds for the football pool problem for 7 and 8 matches
From MaRDI portal
Publication:872721
zbMATH Open1147.94016MaRDI QIDQ872721FDOQ872721
Authors: Wolfgang Haas
Publication date: 28 March 2007
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/129299
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- A new lower bound for the football pool problem for 7 matches
- A combinatorial proof for the football pool problem for six matches
- Several new lower bounds for football pool systems
- An improved upper bound for the football pool problem for nine matches
- A new lower bound for the football pool problem for six matches
Cited In (9)
- Mixed binary/ternary covering codes
- New upper bounds for the football pool problem for 6, 7, and 8 matches
- Upper bounds for football pool problems and mixed covering codes
- New upper bounds for the football pool problem for 11 and 12 matches
- Binary and ternary codes of covering radius one: some new lower bounds
- An improved upper bound for the football pool problem for nine matches
- A new lower bound for the football pool problem for six matches
- Several new lower bounds for football pool systems
- Hypercube packings and coverings with higher dimensional rooks
This page was built for publication: Lower bounds for the football pool problem for 7 and 8 matches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872721)