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

We analyze the version of the deterministic Hats game. In this paper, wepresent new constructors, i.e. theorems that allow built winning strategies forthe sages on different graphs. Using this technique we calculate the hatguessing number ${\text{HG}}_s(G)$ for paths and "petunias", and present aplanar graph $G$ for which ${\text{HG}}_1(G) \ge 22$.

Hat guessing number of planar graphs is at least 22