Work

Picker-Chooser fixed graph games

Year: 2014

Type: preprint

Abstract: Given a fixed graph $H$ and a positive integer $n$, a Picker-Chooser $H$-game is a biased game played on the edge set of $K_n$ in which Picker is trying to force many copies of $H$ 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 $H$ in the random graph $G(n,p)$ and prove our conjecture for special cases of $H$ such as complete graphs and trees.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1402.7308

Authors: Bednarska-Bzdȩga, Małgorzata, Hefetz, Dan, Łuczak, Tomasz

Institutions: Adam Mickiewicz University in Poznań, University of Birmingham

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funder: Engineering and Physical Sciences Research Council

Awards: G8718021159, Robustness of properties of random and pseudo-random graphs