The Lov'asz Local Lemma Is Sharp for the Hat Guessing Number
math.CO, cs.DM
Submitted: 2026-11-03
Updated: 2026-11-03
License: http://creativecommons.org/licenses/by/4.0/
The gist: In the hat guessing game on a graph G, each vertex is occupied by a player wearing a hat whose color is chosen from a set of q colors.
Abstract
In the hat guessing game on a graph G, each vertex is occupied by a player wearing a hat whose color is chosen from a set of q colors. Each player knows the graph and their position in it and sees only the hat colors of their neighbors. The players may agree on a strategy beforehand but must simultaneously try to guess their own hat colors without communicating. They win if at least one player guesses their own hat color correctly. The hat guessing number of G, denoted by HG(G), is the largest integer q for which the players have a strategy that guarantees a win for every assignment of hat colors. A direct application of the symmetric Lovász Local Lemma shows that HG(G) < eΔ for every graph G of maximum degree at most Δ at least 1. We prove that this bound is asymptotically sharp: for every epsilon > 0 and every sufficiently large Δ, there exists a graph G of maximum degree at most Δ with HG(G) at least (e - epsilon)Δ. This answers a question of Alon et al., disproves the conjecture HG(G) at most 2Δ(G) of Bosek et al., and improves on the construction of Latyshev and Kokhas, which achieves HG(G) = 4Δ(G)/3. The hat guessing number thus provides a natural combinatorial problem in which the Lovász Local Lemma is asymptotically tight.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality