The hat guessing number of graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Three Colour Hat Guessing Game on Cycle Graphs

We study a cooperative game in which each member of a team of N players, wearing coloured hats and situated at the vertices of the cycle graph CN , is guessing their own hat colour merely on the basis of observing the hats worn by their two neighbours without exchanging the information. Each hat can have one of three colours. A predetermined guessing strategy is winning if it guarantees at leas...

متن کامل

The Guessing Number of Undirected Graphs

Riis [Electron. J. Combin., 14(1):R44, 2007] introduced a guessing game for graphs which is equivalent to finding protocols for network coding. In this paper we prove upper and lower bounds for the winning probability of the guessing game on undirected graphs. We find optimal bounds for perfect graphs and minimally imperfect graphs, and present a conjecture relating the exact value for all grap...

متن کامل

The linear guessing number of undirected graphs

Article history: Received 15 January 2013 Accepted 5 February 2014 Available online xxxx Submitted by R. Brualdi MSC: 05C72 05C57 68R10 94A99

متن کامل

Hat Guessing Games

Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking at the colors of the hats worn by some of the other players. In this paper we consider several variants of the problem, united by the common theme that the guessing strategies are required to be deterministic and the ob...

متن کامل

Winkler's Hat Guessing Game: Better Results for Imbalanced Hat Distributions

In this note, we give an explicit polynomial-time executable strategy for Peter Winkler’s hat guessing game that gives superior results if the distribution of hats is imbalanced. While Winkler’s strategy guarantees in any case that ⌊n/2⌋ of the n player guess their hat color correct, our strategy ensures that the players produce max{r, b} − 1.2n2/3 − 2 correct guesses for any distribution of r ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2020

ISSN: 0095-8956

DOI: 10.1016/j.jctb.2020.01.003