Maker Can Construct a Sparse Graph on a Small Board

Details Maker Can Construct a Sparse Graph on a Small Board Maker Can Construct a Sparse Graph on a Small Board

2010-11-09

arxiv.org/abs/1011.2178v2

Mathematics

Combinatorics

7 pages

Scientific paper

We study Maker/Breaker games on the edges of sparse graphs. Maker and Breaker take turns in claiming previously unclaimed edges of a given graph H. Maker aims to occupy a given target graph G and Breaker tries to prevent Maker from achieving his goal. We define a function f and show that for every d-regular graph G on n vertices there is a graph H with at most f(d)n edges such that Maker can occupy a copy of G in the game on H.

Affiliated with

Also associated with

No associations

Rating

Maker Can Construct a Sparse Graph on a Small Board 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 Maker Can Construct a Sparse Graph on a Small Board, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maker Can Construct a Sparse Graph on a Small Board will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-494189