Name
Abstract | ||
|---|---|---|
The hat-guessing number is a graph invariant defined by Butler, Hajiaghayi, Kleinberg, and Leighton. We determine the hat-guessing number exactly for book graphs with sufficiently many pages, improving previously known lower bounds of He and Li and exactly matching an upper bound of Gadouleau. We prove that the hat-guessing number of K-3(,3) is 3, making this the first complete bipartite graph K-n,K-n for which the hat-guessing number is known to be smaller than the upper bound of n +1 of Gadouleau and Georgiou. Finally, we determine the hat-guessing number of windmill graphs for most choices of parameters. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.37236/10098 | ELECTRONIC JOURNAL OF COMBINATORICS |
DocType | Volume | Issue |
Journal | 29 | 1 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoyu He | 1 | 0 | 0.34 |
| Yuzu Ido | 2 | 0 | 0.34 |
| Benjamin Przybocki | 3 | 0 | 0.68 |