conference-paper
Open access
The Speed and Threshold of the Biased Hamilton Cycle Game
Research footprint
At a glance
- Citations
- 0
- References
- 7
- Comments
- 0
Paper overview
Abstract
We show that there is a constant C such that for any b < n/ln n − Cn/(ln n)3/2, Maker can win the Maker-Breaker Hamilton cycle game in n + Cn/√ln n steps.
Record transparency
Publication details
- DOI
- 10.1016/j.procs.2021.11.026
- OpenAlex
- W4206763373
- Document type
- conference-paper
- Language
- EN
- Source
- Procedia Computer Science
- Last metadata update
Comments
Log in to join the discussion.