A note on marking lines in [k]^n

DOI10.1007/S10623-011-9507-ZzbMATH Open1257.91005OpenAlexW2212886445WikidataQ122182589 ScholiaQ122182589MaRDI QIDQ690664FDOQ690664

Ron Graham, Steve Butler

Publication date: 28 November 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-011-9507-z

Recommendations

• On a conjecture of Butler and Graham
• The hat guessing number of graphs
• Yet another hat game
• A New Variation of Hat Guessing Games
• A more colorful hat problem

zbMATH Keywords

hat guessing gamescoordinate linesmarking points

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Cooperative games (91A12) Linear codes (general theory) (94B05)

Cites Work

• Hypercube orientations with only two in-degrees
• Hat Guessing Games

Cited In (2)

• Hat guessing numbers of degenerate graphs
• Hypercube orientations with only two in-degrees

This page was built for publication: A note on marking lines in \([k]^n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690664)