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

DOI10.1016/J.JCTB.2016.05.002zbMATH Open1350.05103OpenAlexW2394987969MaRDI QIDQ345067FDOQ345067

Authors: Dennis Clemens, Anita Liebenau 

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

Recommendations

• On the threshold bias in the oriented cycle game
• Biased orientation games
• The oriented cycle game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• The biased odd cycle game

zbMATH Keywords

digraphscyclesorientation games

Mathematics Subject Classification ID

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

Cites Work

• 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
• Combinatorial Games
• On a combinatorial game
• Avoider-enforcer: the rules of the game
• The oriented cycle game
• Title not available (Why is that?)
• Biased orientation games
• Deterministic Graph Games and a Probabilistic Intuition
• The random graph intuition for the tournament game

Cited In (4)

• Biased orientation games
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• The speed and threshold of the biased perfect matching and Hamilton cycle games
• The random graph intuition for the tournament game

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

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