Creating spanning trees in Waiter-Client games

DOI10.37236/12957MaRDI QIDQ6925678zbMATH OpenFDO

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

Publication date 25 September 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/12957

Mathematics Subject Classification ID

Trees (05C05) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Cites work

• Combinatorial Games
• Embedding spanning trees in random graphs
• Fast embedding of spanning trees in biased maker-breaker games
• Fast strategies in Waiter-Client games
• On chooser-picker positional games
• On weight function methods in chooser-picker games
• Positional games
• Positional games and the second moment method
• Random graphs.
• Spanning trees in dense graphs
• Tree universality in positional games

This page was built for publication: Creating spanning trees in Waiter-Client games

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