Chain-making games in grid-like posets

Details Chain-making games in grid-like posets Chain-making games in grid-like posets

2011-08-02

arxiv.org/abs/1108.0710v1

Mathematics

Combinatorics

14 pages, 1 figure

Scientific paper

We study the Maker-Breaker game on the hypergraph of chains of fixed size in a poset. In a product of chains, the maximum size of a chain that Maker can guarantee building is $k-\lfloor r/2\rfloor$, where $k$ is the maximum size of a chain in the product, and $r$ is the maximum size of a factor chain. We also study a variant in which Maker must follow the chain in order, called the {\it Walker-Blocker game}. In the poset consisting of the bottom $k$ levels of the product of $d$ arbitrarily long chains, Walker can guarantee a chain that hits all levels if $d\ge14$; this result uses a solution to Conway's Angel-Devil game. When d=2, the maximum that Walker can guarantee is only 2/3 of the levels, and 2/3 is asymptotically achievable in the product of two equal chains.

Affiliated with

Also associated with

No associations

Rating

Chain-making games in grid-like posets 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 Chain-making games in grid-like posets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chain-making games in grid-like posets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-662896