Name
Abstract | ||
|---|---|---|
Let Maker and Breaker alternately select respectively 1 and q previously unclaimed edges of K"n until all edges have been claimed. In the even cycle game Maker's aim is to create an even cycle. We show that if q=@?n/2@?-1 then Breaker can ensure that Maker's graph is acyclic. We also consider the odd cycle game and show that for q |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.ejc.2007.02.017 | Eur. J. Comb. |
Keywords | Field | DocType |
cycle game maker,odd cycle game,unclaimed edge,maker-breaker game | Discrete mathematics,Graph,Combinatorics,Circuit breaker,Mathematics | Journal |
Volume | Issue | ISSN |
29 | 3 | 0195-6698 |
Citations | PageRank | References |
2 | 0.42 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Małgorzata Bednarska | 1 | 14 | 2.20 |
| Oleg Pikhurko | 2 | 318 | 47.03 |