The Hats game. On maximum degree and diameter

DOI10.1016/J.DISC.2022.112868zbMath1491.91038arXiv2108.08065OpenAlexW4220794129WikidataQ114190537 ScholiaQ114190537MaRDI QIDQ2138959

Konstantin Kokhas, Aleksei Latyshev

Publication date: 17 May 2022

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

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

zbMATH Keywords

graphsdeterministic strategyhat guessing numberhat guessing game

Mathematics Subject Classification ID

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

Related Items (1)

Hat guessing number for the class of planar graphs is at least 22

Cites Work

• The three colour hat guessing game on cycle graphs
• The hat guessing number of graphs
• Cliques and constructors in ``Hats game. I
• Cliques and constructors in ``Hats game. II
• The Hats game. The power of constructors
• Hat guessing on books and windmills
• Hat guessing numbers of degenerate graphs
• For which graphs the sages can guess correctly the color of at least one hat
• Bears with hats and independence polynomials
• New Constructions and Bounds for Winkler's Hat Game

This page was built for publication: The Hats game. On maximum degree and diameter