Bears with hats and independence polynomials

DOI10.1007/978-3-030-86838-3_22OpenAlexW3202380160MaRDI QIDQ2672444

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

Publication date: 8 June 2022

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

zbMATH Keywords

chordal graphsindependence polynomialhat guessing game

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

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

Cites Work

• Unnamed Item
• The three colour hat guessing game on cycle graphs
• The hat guessing number of graphs
• On the guessing number of shift graphs
• 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
• Graph Theory
• On the hat problem on a graph
• 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