Picker-Chooser fixed graph games

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

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


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 Kn 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 classes of graphs H such as complete graphs and trees.

Original languageEnglish
Pages (from-to)122-154
Number of pages33
JournalJournal of Combinatorial Theory. Series B
StatePublished - 1 Jul 2016
Externally publishedYes


  • Counting subgraphs
  • Positional games
  • Probabilistic intuition
  • Random graphs
  • Talagrand's inequality
  • Threshold function


Dive into the research topics of 'Picker-Chooser fixed graph games'. Together they form a unique fingerprint.

Cite this