Hat Guessing Numbers of Strongly Degenerate Graphs
METADATA ONLY
Loading...
Author / Producer
Date
2023-06
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
Assume n players are placed on n vertices of a graph G. The following game was introduced by Winkler: An adversary puts a hat on each player, where each hat has a color out of q available colors. The players can see the hat of each of their neighbors in G but cannot see their own hats. Using a predetermined guessing strategy, the players then simultaneously guess the color of their hats. The players win if at least one of them guesses correctly; otherwise, the adversary wins. The largest integer q such that there is a winning strategy for the players is denoted by HG(G), and this is called the hat guessing number of G. Although this game has received much attention in recent years, not much is known about how the hat guessing number relates to other graph parameters. For instance, a natural open question is whether the hat guessing number can be bounded from above in terms of degeneracy. In this paper, we prove that the hat guessing number of a graph can be bounded from above in terms of a related notion, which we call strong degeneracy. We further give an exact characterization of graphs with bounded strong degeneracy. As a consequence, we significantly improve the best known upper bound on the hat guessing number of outerplanar graphs from 2¹²⁵⁰⁰⁰ to 40 and further derive upper bounds on the hat guessing number for any class of K₂,₈-free graphs with bounded expansion, such as the class of C₄-free planar graphs; more generally, for K₂,₈-free graphs with bounded Hadwiger number or without a Kₜ-subdivision; and for Erdős–Rényi random graphs with constant average degree.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
37 (2)
Pages / Article No.
1331 - 1347
Publisher
SIAM
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Winkler's hat game; hat guessing number; hat chromatic number; degeneracy; bounded expansion; outerplanar graphs
Organisational unit
03672 - Steger, Angelika (emeritus) / Steger, Angelika (emeritus)