For which graphs the sages can guess correctly the color of at least one hat

DOI10.1007/s10958-018-4128-yzbMath1415.05119arXiv1901.07248OpenAlexW3101380329WikidataQ128747123 ScholiaQ128747123MaRDI QIDQ2632547

Yanyan Li

Publication date: 14 May 2019

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.07248

zbMATH Keywords

winning strategyhat problem

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (10)

The Hats game. On maximum degree and diameter ⋮ Hat guessing number for the class of planar graphs is at least 22 ⋮ Hat guessing numbers of degenerate graphs ⋮ Hat chromatic number of graphs ⋮ Cliques and constructors in ``Hats game. I ⋮ Cliques and constructors in ``Hats game. II ⋮ The Hats game. The power of constructors ⋮ On the stability and instability of finite dynamical systems with prescribed interaction graphs ⋮ Hat guessing on books and windmills ⋮ On the hat guessing number of graphs

Cites Work

• Unnamed Item
• The three colour hat guessing game on cycle graphs
• Hat Guessing Games

This page was built for publication: For which graphs the sages can guess correctly the color of at least one hat