Chomp on Graphs and Subsets

Details Chomp on Graphs and Subsets Chomp on Graphs and Subsets

2011-01-14

arxiv.org/abs/1101.2718v1

Mathematics

Combinatorics

24 pages, 13 figures

Scientific paper

The game subset take-away begins with a simplicial complex \Delta. Two players take turns removing any element of \Delta as well as all other elements which contain it, and the last player able to move wins. Graph Chomp is a special case of subset take-away played on a simplicial complex with only vertices and edges. The game has previously only been analyzed for complete graphs, forest graphs, and very small special cases of higher-dimensional simplicial complexes. We generalize a common method of reducing some game positions to simpler ones by symmetry and provide a complete analysis of complete n-partite graphs for arbitrary n and all bipartite graphs. Finally, we give partial results for odd-cycle pseudotrees, which are non-bipartite graphs with a single cycle.

Affiliated with

Also associated with

No associations

Rating

Chomp on Graphs and Subsets 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 Chomp on Graphs and Subsets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chomp on Graphs and Subsets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-78461