科研之友
微信
新浪微博
Facebook
分享链接
摘要
We study biased (a : f) Avoider-Forcer games played on hypergraphs, in the strict and monotone versions. We give a sufficient condition for Avoider%26apos;s win, useful in the case of games on hypergraphs whose rank is smaller than f. We apply this result to estimate the threshold bias in Avoider-Forcer (1: f) games in which Avoider is trying not to build a copy of a fixed graph G in K-n. We also study the d-degree (1: f) game in which Avoider%26apos;s aim is to avoid a spanning subgraph of minimal degree at least d in K-n. We show that the strict 1-degree game has the threshold which is the same as the threshold of the Avoider-Forcer connectivity game.
- 出版日期2014-1-12
