Abstract
In this chapter we discuss the biased Maker-Breaker Hamiltonicity game. Let us recap the setting briefly. This is a (1 : b) Maker-Breaker game, played on the edge set of the complete graph K n . Maker’s aim is to construct a Hamilton cycle, and thus the family of winning sets coincides with the family of (the edge sets of) graphs on n vertices containing a Hamilton cycle. Breaker wins if he manages to put his edge into every Hamilton cycle of the complete graph K n by the end of the game.
If you ever dream of beating me… you better wake up and apologize.
Muhammad Ali
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Basel
About this chapter
Cite this chapter
Hefetz, D., Krivelevich, M., Stojaković, M., Szabó, T. (2014). The Hamiltonicity Game. In: Positional Games. Oberwolfach Seminars, vol 44. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-0825-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-0348-0825-5_6
Published:
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-0824-8
Online ISBN: 978-3-0348-0825-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)