University of Cambridge > Talks.cam > Combinatorics Seminar > Fast wins in n-in-a-row games

Fast wins in n-in-a-row games

Add to your list(s) Download to your calendar using vCal

  • UserMark Walters (Queen Mary London)
  • ClockThursday 06 November 2014, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

The n-in-a-row game is a Maker/Breaker game played on the points of Z^2. Each player takes it in turns to pick a point and Maker wins if he gets n consecutive points on a line with any slope. In the fast variant then rather than picking one point each turn each player picks t points on the t-th turn. Obviously maker can win this game by time n, but can he win any sooner? We answer this and give a much stronger result.

This is joint work with Joshua Erde.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity