Bears with hats and independence polynomials

DOI10.46298/DMTCS.10802MaRDI QIDQ6599792zbMATH OpenFDO

Authors Václav Blažej, Pavel Dvořák, Michal Opler

Publication date 6 September 2024

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license arXiv.org Non-exclusive license to distribute

Full work available at URL https://doi.org/10.46298/DMTCS.10802

zbMATH Keywords

chordal graphshat guessing gameindependence polynomial

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph polynomials (05C31) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• Hat chromatic number of graphs
• The hat guessing number of graphs
• On the hat guessing number of graphs
• The Hats game. On maximum degree and diameter
• Hat guessing number for the class of planar graphs is at least 22

Cites work

• Bears with hats and independence polynomials
• Clique polynomials and independent set polynomials of graphs
• Cliques and constructors in ``Hats game. I
• Cliques and constructors in ``Hats game. II
• Derandomization of auctions
• Finite dynamical systems, hat games, and coding theory
• Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
• Hat chromatic number of graphs
• Hat Guessing Games
• Hat guessing numbers of degenerate graphs
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Information flows, graphs and their guessing numbers
• New constructions and bounds for Winkler's hat game
• On a problem of Spencer
• On Dependency Graphs and the Lattice Gas
• On the Autoreducibility of Random Sequences
• On the guessing number of shift graphs
• The hat guessing number of graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• The lefthanded local lemma characterizes chordal dependency graphs
• The NP-Completeness of Edge-Coloring
• The three colour hat guessing game on cycle graphs

Cited in

(1)

• Prisoners in a line transmitting (binary+ ) bits of information

This page was built for publication: Bears with hats and independence polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599792)