Picker-Pickerser固定图对策
Picker-Chooser fixed graph games
摘要：
给定一个固定图$H$和一个正整数$n$，Picker-Priser $H$ -game是在$K_n$的边集上进行的有偏博弈，其中Picker试图强迫多个$H$的副本，Priser试图阻止他这样做。在本文中，我们猜想，游戏的价值是大致相同的期望数量的$H$的随机图$G(n,p)$，并证明了我们的猜想的特殊情况下，$H$，如完全图和树。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
