Biased positional games and small hypergraphs with large covers

zbMath1160.91007MaRDI QIDQ1010790

Michael Krivelevich, Tibor Szabó

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129879

Mathematics Subject Classification ID

Hypergraphs (05C65) Games involving graphs (91A43) Combinatorial games (91A46)

Related Items

Avoider-Enforcer games played on edge disjoint hypergraphs ⋮ Graph Tilings in Incompatibility Systems ⋮ Sharp thresholds for half-random games I ⋮ Avoider-forcer games on hypergraphs with small rank ⋮ Hamilton cycles in highly connected and expanding graphs ⋮ Biased orientation games ⋮ Manipulative Waiters with Probabilistic Intuition ⋮ Avoider-enforcer: the rules of the game ⋮ Robust Hamiltonicity of Dirac graphs ⋮ Asymptotic random graph intuition for the biased connectivity game ⋮ The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛 ⋮ On the separation conjecture in avoider-enforcer games ⋮ On the threshold for the Maker-BreakerH-game ⋮ Avoider-Enforcer: The Rules of the Game ⋮ Biased games on random boards ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs