Walker-breaker games on \(G_{n, p}\)

DOI10.37236/11866MaRDI QIDQ6635169

Pranshu Gupta, Yannick Mogge, Dennis Clemens

Publication date: 9 November 2024

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

zbMATH Keywords

spanning treepositional gamesbiased gamesconnectivity game

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Creating cycles in walker-breaker games
• Doubly biased maker-breaker connectivity game
• Threshold functions
• Connector-breaker games on random boards
• On the WalkerMaker-WalkerBreaker games
• On the odd cycle game and connected rules
• Local resilience for squares of almost spanning cycles in sparse random graphs
• Triangle resilience of the square of a Hamilton cycle in random graphs
• The threshold bias of the clique-factor game
• Random graphs.
• Walker-Breaker Games
• The diameter game
• Asymptotic random graph intuition for the biased connectivity game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Resilient Pancyclicity of Random and Pseudorandom Graphs
• Dirac's theorem for random graphs
• Generating random graphs in biased Maker-Breaker games
• A sharp threshold for the Hamilton cycle Maker–Breaker game
• Remarks on positional games. I
• Biased Positional Games
• Spanning Tree Game as Prim Would Have Played
• Positional Games
• Spanning Structures in Walker–Breaker Games
• Combinatorial Games
• A Solution of the Shannon Switching Game
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: Walker-breaker games on \(G_{n, p}\)

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