arXiv (All)
open access
An upper bound on the proper hat guessing number of graphs
We study the proper hat guessing game on graphs, introduced by Adriaensen et al. \cite{adriaensen2026hatguessingpropercolorings}. In this game, the players are seated on the vertices of a graph $G$ and assigned hats from a set of $k$ colors such that the resulting assignment forms a proper coloring.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Graph Coloring with Color Preferences#820007
- Double-Partition Coloring problem: a unified approach for conflict-free coloring of hypergraphs and other coloring problems in graphs#1233193
- The Erdős Matching Conjecture for 4-uniform hypergraphs#1070833
- When chromatic polynomials coincide with list-color functions: a threshold linear in the maximum degree#998428
- Partitioning an $S$-packing coloring into broadcast dominating sets#1188155
Record · ID 1199398
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive