7 citations · 11 across the 6 of their papers we have counts for
6 papers
The partial gossip problem revisited
Konstantin Kokhas, Olga Bursian
We present correct proof of G. Chung, Y.-J. Tsay result on partial gossip problem.
Hat guessing number of planar graphs is at least 22
Aleksei Latyshev, Konstantin Kokhas
We analyze the version of the deterministic Hats game. In this paper, we present new constructors, i.e. theorems that allow built winning strategies for the sages on different grap…
The Hats game. On maximum degree and diameter
Aleksei Latyshev, Konstantin Kokhas
We analyze the following version of the deterministic \hats game. We have a graph , and a sage resides at each vertex of . When the game starts, an adversary puts on the head…
The Hats game. The power of constructors
Aleksei Latyshev, Konstantin Kokhas
We analyze the following general version of the deterministic Hats game. Several sages wearing colored hats occupy the vertices of a graph. Each sage can have a hat of one of c…
Cliques and constructors in "Hats'"game
Konstantin Kokhas, Aleksei Latyshev, Vadim Retinsky
The following general variant of deterministic Hats game is analyzed. Several sages wearing colored hats occupy the vertices of a graph, the -th sage can have hats of one of $h(…
For which graphs the sages can guess correctly the color of at least one hat
Konstantin Kokhas, Aleksei Latyshev
Several sages wearing colored hats occupy the vertices of a graph. Each sage tries to guess the color of his own hat merely on the basis of observing the hats of his neighbours wit…