Online Talk: Nathan Bowler

YouTube recording:

Please advertise this talk at your home institution. Anyone is welcome to attend! 

Time: Wednesday, Sep 20 at 3pm ET

Speaker: Nathan Bowler, Universität Hamburg
Title: The $K_4$ game

Abstract: Two players alternately claim edges of a complete graph on infinitely many vertices. The first to claim all edges of a $K_4$ wins. Can the first player force a win? I will explain the history of this question, why it is harder than it seems, and how to win this game.

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.