Hat guessing numbers of degenerate graphs

DOI10.37236/9449zbMath1448.05143arXiv2003.04990OpenAlexW3110419541MaRDI QIDQ2200434

Ray Li, Xiaoyu He

Publication date: 21 September 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.04990

zbMATH Keywords

hypercubehat guessing gameshat gamedeterministic strategiesguessing stategyhat colorsTutte-Berge formula

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Recreational mathematics (00A08) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (8)

The Hats game. On maximum degree and diameter ⋮ Bears with hats and independence polynomials ⋮ On the hat guessing number of a planar graph class ⋮ Hat Guessing Numbers of Strongly Degenerate Graphs ⋮ Hat guessing number for the class of planar graphs is at least 22 ⋮ Hat chromatic number of graphs ⋮ Hat guessing on books and windmills ⋮ On the hat guessing number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The three colour hat guessing game on cycle graphs
• A note on marking lines in \([k^n\)]
• The hat guessing number of graphs
• Information flows, graphs and their guessing numbers
• For which graphs the sages can guess correctly the color of at least one hat
• On the hat problem on a graph
• On the Autoreducibility of Random Sequences
• Finite Dynamical Systems, Hat Games, and Coding Theory
• New Constructions and Bounds for Winkler's Hat Game
• Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
• Derandomization of auctions
• Hat Guessing Games

This page was built for publication: Hat guessing numbers of degenerate graphs