2000 character limit reached
Hat guessing number of planar graphs is at least 22
Published 24 Jan 2023 in math.CO | (2301.10305v1)
Abstract: We analyze the version of the deterministic Hats game. In this paper, we present new constructors, i.e. theorems that allow built winning strategies for the sages on different graphs. Using this technique we calculate the hat guessing number ${\text{HG}}_s(G)$ for paths and "petunias", and present a planar graph $G$ for which ${\text{HG}}_1(G) \ge 22$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.