Abstract
The hat-guessing number is a graph invariant defined by Butler, Hajiaghayi, Kleinberg, and Leighton. We determine the hat-guessing number exactly for book graphs with sufficiently many pages, improving previously known lower bounds of He and Li and exactly matching an upper bound of Gadouleau. 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 Gadouleau and Georgiou. Finally, we determine the hat-guessing number of windmill graphs for most choices of parameters.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.