The speed and threshold of the biased perfect matching and Hamilton cycle games

DOI10.1016/J.DAM.2023.01.031OpenAlexW4320477987MaRDI QIDQ2696609

Yanyan Li

Publication date: 17 April 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.01.031

zbMATH Keywords

threshold biasperfect matching gameMaker-Breaker gamesHamilton cycle game

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Eulerian and Hamiltonian graphs (05C45) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• On two problems regarding the Hamiltonian cycle game
• Hamiltonian circuits in random graphs
• Positional games
• Fast winning strategies in maker-breaker games
• Asymptotic random graph intuition for the biased connectivity game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Biased Positional Games
• Fast strategies in biased Maker--Breaker games

This page was built for publication: The speed and threshold of the biased perfect matching and Hamilton cycle games