The Critical Bias for the Hamiltonicity Game

Abstract

This paper serves as an exposition on the theorem proved by Michael Krivelevich which states that the critical bias for the Hamiltonicity game between a Maker and Breaker can be generalised. It also provides a basic overview of some concepts used in Combinatorial Game Theory and Graph Theory and applies these to the proof using tools outlined through previous research.