Maker-Breaker Games on Randomly Perturbed Graphs
From MaRDI portal
Publication:5013573
DOI10.1137/20M1385044zbMath1479.05224arXiv2009.14583OpenAlexW3212807627MaRDI QIDQ5013573
Dennis Clemens, Yannick Mogge, Fabian Hamann, Olaf Parczyk
Publication date: 1 December 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.14583
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamilton cycles in highly connected and expanding graphs
- Bart--Moe games, JumbleG and discrepancy
- Hamiltonian circuits in random graphs
- Positional games
- The threshold bias of the clique-factor game
- On the threshold for the Maker-BreakerH-game
- Hitting time results for Maker-Breaker games
- A threshold for the Maker-Breaker clique game
- Asymptotic random graph intuition for the biased connectivity game
- Dependent random choice
- The critical bias for the Hamiltonicity game is (1+đ(1))đ/lnđ
- On the strength of connectedness of a random graph
- On smoothed analysis in dense graphs and formulas
- Generating random graphs in biased Maker-Breaker games
- Factors in random graphs
- A sharp threshold for the Hamilton cycle MakerâBreaker game
- Remarks on positional games. I
- Biased Positional Games
- Adding random edges to dense graphs
- Positional games on random graphs
- How many random edges make a dense graph hamiltonian?
- Playing to Retain the Advantage
- Ramsey properties of randomly perturbed graphs: cliques and cycles
- Tilings in Randomly Perturbed Dense Graphs
- Biased games on random boards
- Probability Inequalities for Sums of Bounded Random Variables
- Combinatorial Games
- Robust Hamiltonicity of Dirac graphs
- Some Theorems on Abstract Graphs
- On the structure of linear graphs
- Biased positional games for which random strategies are nearly optimal
- Tilings in randomly perturbed graphs: Bridging the gap between HajnalâSzemerĂ©di and JohanssonâKahnâVu
This page was built for publication: Maker-Breaker Games on Randomly Perturbed Graphs
