Generating Random Graphs in Biased Maker-Breaker Games

Tuesday, February 17, 2015 - 2:00pm - 3:00pm
Lind 305
Humberto Naves (University of Minnesota, Twin Cities)
In this talk we present a general approach connecting biased Maker-Breaker games and problems about local resilience in random graphs. Using this
method, we investigate the threshold bias b for which Maker can win certain (1 : b) games. We utilize this approach to prove new results and also to derive some known results about biased games.

Joint work with: Michael Krivelevich and Asaf Ferber