For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat

K. Kokhas, A. Latyshev

Research output

1 Citation (Scopus)

Abstract

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 neighbors without exchanging any information. Each hat can have one of three colors. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. We completely solve the problem of describing all graphs for which the sages win.

Original languageEnglish
JournalJournal of Mathematical Sciences (United States)
Volume236
Issue number5
DOIs
Publication statusAccepted/In press - 1 Jan 2018

Fingerprint

Guess
Color
Graph in graph theory
Assignment
Vertex of a graph

Scopus subject areas

  • Mathematics(all)
  • Statistics and Probability
  • Applied Mathematics

Cite this

@article{1feb913513f349ab871673e0a5a4bb31,
title = "For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat",
abstract = "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 neighbors without exchanging any information. Each hat can have one of three colors. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. We completely solve the problem of describing all graphs for which the sages win.",
author = "K. Kokhas and A. Latyshev",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/s10958-018-4128-y",
language = "English",
volume = "236",
journal = "Journal of Mathematical Sciences",
issn = "1072-3374",
publisher = "Springer",
number = "5",

}

TY - JOUR

T1 - For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat

AU - Kokhas, K.

AU - Latyshev, A.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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 neighbors without exchanging any information. Each hat can have one of three colors. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. We completely solve the problem of describing all graphs for which the sages win.

AB - 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 neighbors without exchanging any information. Each hat can have one of three colors. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. We completely solve the problem of describing all graphs for which the sages win.

UR - http://www.scopus.com/inward/record.url?scp=85058455121&partnerID=8YFLogxK

U2 - 10.1007/s10958-018-4128-y

DO - 10.1007/s10958-018-4128-y

M3 - Article

AN - SCOPUS:85058455121

VL - 236

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

SN - 1072-3374

IS - 5

ER -