Bears with Hats and Independence Polynomials
Open Access
- 20 September 2021
- book chapter
- Published by Springer Nature
- p. 283-295
Abstract
Consider the following hat guessing game. A bear sits on each vertex of a graph G, and a demon puts on each bear a hat colored by one of h colors. Each bear sees only the hat colors of his neighbors. Based on this information only, each bear has to guess g colors and he guesses correctly if his hat color is included in his guesses. The bears win if at least one bear guesses correctly for any hat arrangement.We introduce a new parameter—fractional hat chromatic number $$\hat{\mu }$$ , arising from the hat guessing game. The parameter $$\hat{\mu }$$ is related to the hat chromatic number which has been studied before. We present a surprising connection between the hat guessing game and the independence polynomial of graphs. This connection allows us to compute the fractional hat chromatic number of chordal graphs in polynomial time, to bound fractional hat chromatic number by a function of maximum degree of G, and to compute the exact value of $$\hat{\mu }$$ of cliques, paths, and cycles.
Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- The lefthanded local lemma characterizes chordal dependency graphsRandom Structures & Algorithms, 2012
- On the hat problem on a graphOpuscula Mathematica, 2012
- On the guessing number of shift graphsJournal of Discrete Algorithms, 2009
- Hat Guessing GamesSIAM Journal on Discrete Mathematics, 2008
- On Dependency Graphs and the Lattice GasCombinatorics, Probability and Computing, 2006
- On the Autoreducibility of Random SequencesSIAM Journal on Computing, 2003
- Clique polynomials and independent set polynomials of graphsDiscrete Mathematics, 1994
- An Introduction to Chordal Graphs and Clique Trees1993
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974