Download presentation

Presentation is loading. Please wait.

Published byEthen Wetmore Modified over 2 years ago

1
Biased Positional Games and the Erdős Paradigm Michael Krivelevich Tel Aviv University

2
It all started with Erdős – as usually… This time with Chvátal: 1

3
Unbiased Maker-Breaker games on complete graphs 2 unbiased

4
It is (frequently) all too easy for Maker… Ex.: Hamiltonicity game Maker wins if creates a Hamilton cycle CE: Maker wins, very fast - in ≤ 2n moves (…, Hefetz, Stich’09: Makers wins in n+1 moves, optimal) Ex.: Non-planarity game Maker wins if creates a non-planar graph -just wait for it to come ( but grab an edge occasionally…) - after 3n-5 rounds Maker, doing anything, has a non-planar graph… 3

5
Tools of the trade 4

6
Biased Maker-Breaker games 5 More generally, m edges per move

7
Biased Erdős-Selfridge 6

8
Bias monotonicity, critical bias 7 321b* bias MMMMBBB Critical point: game changes hands M winner

9
So what is the critical bias for…? 8

10
Probabilistic intuition/Erdős paradigm 9

11
Probabilistic intuition/Erdős paradigm (cont.) 10

12
Sample results for G(n,m) 11

13
Breaker’s side 12

14
It works! 13

15
It works! (cont.) 14

16
It works! (kind of…) 15

17
It works! (sometimes…) 16

18
Positional games and Ramsey numbers 17

19
Positional games and Ramsey numbers (cont.) 18

Similar presentations

OK

On the power of choices in random graph processes Reto Spöhel, PhD Defense February 17, 2010, ETH Zürich Examiners: Prof. Dr. Angelika Steger, ETH Zürich.

On the power of choices in random graph processes Reto Spöhel, PhD Defense February 17, 2010, ETH Zürich Examiners: Prof. Dr. Angelika Steger, ETH Zürich.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google