2 problems
- 0 votes0 replies0 views
Asymptotic monotonicity conjecture for Avoider-Enforcer games
Asymptotic monotonicity conjecture. The Avoider-Enforcer non-planarity, non--colorability and -minor games are asymptotically monotone for every and .
- 0 votes0 replies0 views
The threshold-order conjecture for fixed-graph Avoider-Enforcer games
Let be a fixed graph. In the Avoider-Enforcer game on the edge set of , let be the family of all copies of , and let and…