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 study (a:a) Maker-Breaker games played on the edge set of the completegraph on n vertices. In the following four games - perfect matching game,Hamilton cycle game, star factor game and path factor game, our goal is todetermine the least number of moves which Maker needs in order to win thesegames. Moreover, for all games except for the star factor game, we show how Redcan win in the strong version of these games.

How fast can Maker win in fair biased games?