Biased orientation games

Details Biased orientation games Biased orientation games

2011-07-10

arxiv.org/abs/1107.1844v1

Mathematics

Combinatorics

Scientific paper

We study biased {\em orientation games}, in which the board is the complete graph $K_n$, and Maker and Breaker take turns in directing previously undirected edges of $K_n$. At the end of the game, the obtained graph is a tournament. Maker wins if the tournament has some property $\mathcal P$ and Breaker wins otherwise. We provide bounds on the bias that is required for a Maker's win and for a Breaker's win in three different games. In the first game Maker wins if the obtained tournament has a cycle. The second game is Hamiltonicity, where Maker wins if the obtained tournament contains a Hamilton cycle. Finally, we consider the $H$-creation game, where Maker wins if the obtained tournament has a copy of some fixed graph $H$.

Affiliated with

Also associated with

No associations

Rating

Biased orientation games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Biased orientation games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Biased orientation games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33618