{"id":4451,"date":"2021-11-10T16:48:31","date_gmt":"2021-11-10T21:48:31","guid":{"rendered":"http:\/\/matroidunion.org\/?p=4451"},"modified":"2021-11-18T01:38:11","modified_gmt":"2021-11-18T06:38:11","slug":"online-talk-nathan-bowler-2","status":"publish","type":"post","link":"https:\/\/matroidunion.org\/?p=4451","title":{"rendered":"Online Talk: Nathan Bowler"},"content":{"rendered":"\n<p><strong>Tuesday, Nov 16,<\/strong> <strong>3pm ET<\/strong> (8pm GMT, 9am Wed NZDT)<br \/><strong><a href=\"https:\/\/www.math.uni-hamburg.de\/home\/bowler\/\">Nathan Bowler<\/a><\/strong>, University of Hamburg<br \/><strong>Infinite Maker-Breaker games<\/strong><\/p>\n<div><strong>YouTube: <\/strong><a href=\"https:\/\/youtu.be\/1-YDKSn7JSc\">https:\/\/youtu.be\/1-YDKSn7JSc<\/a><\/div>\n<h5>\u00a0<\/h5>\n<h5><strong>Abstract:<\/strong><\/h5>\n<h5>Consider a game played on a countably infinite complete graph, in which two players, called Maker and Breaker, alternately claim edges. Maker&#8217;s aim is that after infinitely many moves she should have claimed all edges of some infinite complete subgraph, and Breaker&#8217;s aim is to prevent this. Marit Emde recently found a winning strategy for Maker in this game. We&#8217;ll investigate a number of variants of this basic game, and the kinds of winning strategies Maker and Breaker have in them.<\/h5>\n","protected":false},"excerpt":{"rendered":"<p>Tuesday, Nov 16, 3pm ET (8pm GMT, 9am Wed NZDT)Nathan Bowler, University of HamburgInfinite Maker-Breaker games YouTube: https:\/\/youtu.be\/1-YDKSn7JSc \u00a0 Abstract: Consider a game played on a countably infinite complete graph, in which two players, called Maker and Breaker, alternately claim &hellip; <a href=\"https:\/\/matroidunion.org\/?p=4451\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":20,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[11],"class_list":["post-4451","post","type-post","status-publish","format-standard","hentry","category-matroids","tag-online-talks"],"_links":{"self":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4451","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/users\/20"}],"replies":[{"embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=4451"}],"version-history":[{"count":2,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4451\/revisions"}],"predecessor-version":[{"id":4466,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4451\/revisions\/4466"}],"wp:attachment":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4451"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=4451"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=4451"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}