Bears with hats and independence polynomials

DOI10.46298/dmtcs.10802zbMATH Open1546.05099MaRDI QIDQ6599792

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

Publication date: 6 September 2024

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

zbMATH Keywords

chordal graphsindependence polynomialhat guessing game

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The three colour hat guessing game on cycle graphs
• The hat guessing number of graphs
• On the guessing number of shift graphs
• On a problem of Spencer
• Clique polynomials and independent set polynomials of graphs
• Cliques and constructors in ``Hats game. I
• Cliques and constructors in ``Hats game. II
• Hat guessing numbers of degenerate graphs
• Hat chromatic number of graphs
• Information flows, graphs and their guessing numbers
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Bears with hats and independence polynomials
• The lefthanded local lemma characterizes chordal dependency graphs
• On Dependency Graphs and the Lattice Gas
• The NP-Completeness of Edge-Coloring
• 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: Bears with hats and independence polynomials