Biased orientation games

DOI10.1016/j.disc.2012.01.026zbMath1242.05177arXiv1107.1844OpenAlexW2104111637MaRDI QIDQ418878

Ido Ben-Eliezer, Michael Krivelevich, Benjamin Sudakov

Publication date: 30 May 2012

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

Full work available at URL: https://arxiv.org/abs/1107.1844

zbMATH Keywords

directed graphsorientation gameshamiltonicity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

A non-trivial upper bound on the threshold bias of the oriented-cycle game ⋮ The Random Graph Intuition for the Tournament Game

Cites Work

• Unnamed Item
• Unnamed Item
• Biased positional games and small hypergraphs with large covers
• The oriented cycle game
• Tournaments and colouring
• The diameter game
• Asymptotic random graph intuition for the biased connectivity game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Remarks on positional games. I
• Biased Positional Games
• Combinatorial Games
• On a combinatorial game
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: Biased orientation games