{"id":3483,"date":"2020-11-18T09:15:55","date_gmt":"2020-11-18T14:15:55","guid":{"rendered":"http:\/\/matroidunion.org\/?p=3483"},"modified":"2020-11-25T11:58:14","modified_gmt":"2020-11-25T16:58:14","slug":"online-talk-sarah-allred","status":"publish","type":"post","link":"https:\/\/matroidunion.org\/?p=3483","title":{"rendered":"Online talk: Sarah Allred"},"content":{"rendered":"\n<h5><strong>Monday, November 23,<\/strong> <strong>3pm ET<\/strong> (8pm GMT, 9am Tue NZDT)<br \/><strong>Sarah Allred<\/strong>, LSU<br \/><strong>Unavoidable Induced Subgraphs of Large 2-connected Graphs<\/strong><\/h5>\n<h5><a href=\"https:\/\/youtu.be\/AKKe7kTND-A\"><b>YouTube<\/b><\/a><\/h5>\n<h5>\u00a0<\/h5>\n<h5><b><\/b><strong>Abstract:<\/strong><\/h5>\n<div>It is well known that, for every positive integer $r$, every sufficiently large connected graph contains an induced subgraph isomorphic to one of the following: a large complete graph, a large star, and a long path.\u00a0 We prove an analogous result for 2-connected graphs. \u00a0In particular, we show that every sufficiently large 2-connected graph contains an induced subgraph isomorphic to one of the following: a complete graph, a subdivision of $K_{2,r}$ with possibly an edge joining the two vertices of degree $r$, and a graph that has a well-described ladder structure.<\/div>\n<div>\u00a0<\/div>\n<div>This is joint work with Guoli Ding and Bogdan Oporowski.\u00a0<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Monday, November 23, 3pm ET (8pm GMT, 9am Tue NZDT)Sarah Allred, LSUUnavoidable Induced Subgraphs of Large 2-connected Graphs YouTube \u00a0 Abstract: It is well known that, for every positive integer $r$, every sufficiently large connected graph contains an induced subgraph &hellip; <a href=\"https:\/\/matroidunion.org\/?p=3483\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":19,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[11],"class_list":["post-3483","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\/3483","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\/19"}],"replies":[{"embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=3483"}],"version-history":[{"count":4,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/3483\/revisions"}],"predecessor-version":[{"id":3498,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/3483\/revisions\/3498"}],"wp:attachment":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=3483"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=3483"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=3483"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}