On the hat problem on a graph
From MaRDI portal
Publication:2901951
DOI10.7494/OPMATH.2012.32.2.285zbMATH Open1245.05022MaRDI QIDQ2901951FDOQ2901951
Authors: Marcin Krzywkowski
Publication date: 31 July 2012
Published in: Opuscula Mathematica (Search for Journal in Brave)
Recommendations
Cited In (21)
- Hat guessing numbers of degenerate graphs
- Hat problem: a new strategy based on quantum stabilizer codes
- On Levine’s notorious hat puzzle
- On optimal strategies for a hat game on graphs
- A numbers-on-foreheads game
- Hat problem on odd cycles
- A construction for the hat problem on a directed graph
- The hat problem on cycles on at least nine vertices.
- Hat problem on graphs with exactly three cycles
- Hat problem on bicyclic graphs
- On the hat problem on the cycle \(C_7\)
- The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs
- Bears with hats and independence polynomials
- On the stability and instability of finite dynamical systems with prescribed interaction graphs
- The hat guessing number of graphs
- Title not available (Why is that?)
- Hat chromatic number of graphs
- A modified hat problem
- New constructions and bounds for Winkler's hat game
- Finite dynamical systems, hat games, and coding theory
- The hat problem on a union of disjoint graphs
This page was built for publication: On the hat problem on a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901951)