On Optimal Strategies for a Hat Game on Graphs

DOI10.1137/090778791zbMath1223.05190OpenAlexW2037738030MaRDI QIDQ3008007

No author found.

Publication date: 17 June 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/586b7db2bd4c3015219a893618740287374b22cb

zbMATH Keywords

conjecturecliquehat problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

On a conjecture of Butler and Graham ⋮ The three colour hat guessing game on cycle graphs ⋮ Hat problem: a new strategy based on quantum stabilizer codes

This page was built for publication: On Optimal Strategies for a Hat Game on Graphs