Picker-Chooser fixed graph games
Combinatorics
2015-12-23 v2
Abstract
Given a fixed graph and a positive integer , a Picker-Chooser -game is a biased game played on the edge set of in which Picker is trying to force many copies of and Chooser is trying to prevent him from doing so. In this paper we conjecture that the value of the game is roughly the same as the expected number of copies of in the random graph and prove our conjecture for special cases of such as complete graphs and trees.
Cite
@article{arxiv.1402.7308,
title = {Picker-Chooser fixed graph games},
author = {Małgorzata Bednarska-Bzdȩga and Dan Hefetz and Tomasz Łuczak},
journal= {arXiv preprint arXiv:1402.7308},
year = {2015}
}