Guessing Numbers and Extremal Graph Theory

Jo Martin, Puck Rombach

For a given number of colors, $s$, the guessing number of a graph is the (base $s$) logarithm of the cardinality of the largest family of colorings of the vertex set of the graph s…