Biased positional games and small hypergraphs with large covers

zbMATH Open1160.91007MaRDI QIDQ1010790FDOQ1010790

Authors: 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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Winning fast in biased maker-breaker games
• Fast strategies in biased Maker-Breaker games
• Biased games on random boards
• The speed and threshold of the biased perfect matching and Hamilton cycle games

Mathematics Subject Classification ID

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

Cited In (16)

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

This page was built for publication: Biased positional games and small hypergraphs with large covers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010790)