A non-trivial upper bound on the threshold bias of the oriented-cycle game

DOI10.1016/J.JCTB.2016.05.002zbMath1350.05103OpenAlexW2394987969MaRDI QIDQ345067

Anita Liebenau, Dennis Clemens

Publication date: 25 November 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2016.05.002

zbMATH Keywords

cyclesdigraphsorientation games

Mathematics Subject Classification ID

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

Related Items (1)

The Random Graph Intuition for the Tournament Game

Cites Work

• Unnamed Item
• Biased orientation games
• Avoider-enforcer: the rules of the game
• The oriented cycle game
• Biased positional games on matroids
• Avoider-Enforcer games
• 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
• Deterministic Graph Games and a Probabilistic Intuition
• The Random Graph Intuition for the Tournament Game
• Combinatorial Games
• On a combinatorial game

This page was built for publication: A non-trivial upper bound on the threshold bias of the oriented-cycle game