Standard

For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat. / Kokhas, K.; Latyshev, A.

In: Journal of Mathematical Sciences (United States), Vol. 236, No. 5, 2018, p. 503-520.

Research output: Contribution to journal › Article › peer-review

Harvard

Kokhas, K & Latyshev, A 2018, 'For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat', Journal of Mathematical Sciences (United States), vol. 236, no. 5, pp. 503-520. https://doi.org/10.1007/s10958-018-4128-y

APA

Kokhas, K., & Latyshev, A. (2018). For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat. Journal of Mathematical Sciences (United States), 236(5), 503-520. https://doi.org/10.1007/s10958-018-4128-y

Vancouver

Kokhas K, Latyshev A. For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat. Journal of Mathematical Sciences (United States). 2018;236(5):503-520. https://doi.org/10.1007/s10958-018-4128-y

Author

Kokhas, K. ; Latyshev, A. / For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat. In: Journal of Mathematical Sciences (United States). 2018 ; Vol. 236, No. 5. pp. 503-520.

BibTeX

@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",
note = "Kokhas, K., Latyshev, A. For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat. J Math Sci 236, 503–520 (2019). https://doi.org/10.1007/s10958-018-4128-y",
year = "2018",
doi = "10.1007/s10958-018-4128-y",
language = "English",
volume = "236",
pages = "503--520",
journal = "Journal of Mathematical Sciences",
issn = "1072-3374",
publisher = "Springer Nature",
number = "5",

}

RIS

TY - JOUR

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

AU - Kokhas, K.

AU - Latyshev, A.

N1 - Kokhas, K., Latyshev, A. For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat. J Math Sci 236, 503–520 (2019). https://doi.org/10.1007/s10958-018-4128-y

PY - 2018

Y1 - 2018

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

SP - 503

EP - 520

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

SN - 1072-3374

IS - 5

ER -

ID: 37050317