English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $G$ be a graph with $n$ vertices. The {\em hat guessing number} of $G$ isdefined in terms of the following game: There are $n$ players and one opponent.The opponent will wear one of the $q$ hats of different colors on the player'shead. At this time, the player can only see the player's hat color at theadjacent vertex, and communication between players is not allowed. Once playersare assigned hats, each player must guess the color of his hat at the sametime. If at least one player guesses right, then they will win collectively.Given a graph $G$, its hat guessing number $HG(G)$ is the largest integer $q$such that there exists a guessing strategy guaranteeing at least one correctguess for any hat assignment of $q$ different colors.  Let $\mathcal{G}(n,p)$ denote the Erd\H{o}s-R\'{e}nyi random graphs with $n$vertices and edge-chosen probability $ p\in(0,1)$. Alon-Chizewer andBosek-Dudek-Farnik-Grytczuk-Mazur investigated the lower and upper bound for$HG(G)$ when $G\in \mathcal{G}(n,1/2)$, respectively. In this paper, we extendstheir results by showing that for any constant number $p$, we have $n^{1 -o(1)}\le HG(G) \le (1-o(1))n$ with high probability when $G\in\mathcal{G}(n,p)$.

The hat guessing number of random graphs with constant edge-chosen probability