Tree universality in positional games

DOI10.1017/S0963548324000397MaRDI QIDQ6880000zbMATH OpenFDO

Authors Grzegorz Adamski, Sylwia Antoniuk, Małgorzata Bednarska-Bzdȩga, Dennis Clemens, Fabian Hamann, Yannick Mogge

Publication date 29 December 2025

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548324000397

zbMATH Keywords

treeembeddinguniversalitymaker-breaker gamesexpanderwaiter-client games

Mathematics Subject Classification ID

2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57) Hypergraphs (05C65) Games involving graphs (91A43) Combinatorial games (91A46)

Cites work

• A Solution of the Shannon Switching Game
• A matching game
• A sharp threshold for the Hamilton cycle Maker–Breaker game
• Asymptotic random graph intuition for the biased connectivity game
• Biased Positional Games
• Building spanning trees quickly in maker-breaker games
• Client-waiter games on complete and random graphs
• Combinatorial Games
• Embedding spanning trees in random graphs
• Expanders Are Universal for the Class of All Spanning Trees
• Fast embedding of spanning trees in biased maker-breaker games
• Fast strategies in Waiter-Client games
• Fast strategies in maker-breaker games played on random boards
• Fast winning strategies in maker-breaker games
• Manipulative waiters with probabilistic intuition
• Multistage positional games
• On a combinatorial game
• On chooser-picker positional games
• On weight function methods in chooser-picker games
• Positional games
• The diameter game
• The threshold bias of the clique-factor game
• Tree embeddings
• Waiter-Client and Client-Waiter planarity, colorability and minor games
• Waiter-client clique-factor game

Cited in

(1)

• Creating spanning trees in Waiter-Client games

This page was built for publication: Tree universality in positional games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880000)