Hat guessing on books and windmills (Q2073305)

Summary: The hat-guessing number is a graph invariant defined by \textit{S. Butler} et al. [SIAM Rev. 51, No. 2, 399--413 (2009; Zbl 1166.91004)]. We determine the hat-guessing number exactly for book graphs with sufficiently many pages, improving previously known lower bounds of \textit{X. He} and \textit{R. Li} [Electron. J. Comb. 27, No. 3, Research Paper P3.58, 9 p. (2020; Zbl 1448.05143)] and exactly matching an upper bound of \textit{M. Gadouleau} [SIAM J. Discrete Math. 32, No. 3, 1922--1945 (2018; Zbl 1408.91050)]. We prove that the hat-guessing number of \(K_{3,3}\) is \(3\), making this the first complete bipartite graph \(K_{n,n}\) for which the hat-guessing number is known to be smaller than the upper bound of \(n+1\) of \textit{M. Gadouleau} and \textit{N. Georgiou} [ibid. 29, No. 2, 823--834 (2015; Zbl 1388.91076)]. Finally, we determine the hat-guessing number of windmill graphs for most choices of parameters.