{"id":4827,"date":"2023-03-23T09:05:33","date_gmt":"2023-03-23T13:05:33","guid":{"rendered":"http:\/\/matroidunion.org\/?p=4827"},"modified":"2023-03-31T08:38:53","modified_gmt":"2023-03-31T12:38:53","slug":"online-talk-ruth-luo","status":"publish","type":"post","link":"https:\/\/matroidunion.org\/?p=4827","title":{"rendered":"Online Talk: Ruth Luo"},"content":{"rendered":"\n<p><strong>YouTube recording:\u00a0<\/strong><a href=\"https:\/\/www.youtube.com\/watch?v=iIcl15EgNe4\" target=\"_blank\" rel=\"noopener\">https:\/\/www.youtube.com\/watch?v=iIcl15EgNe4<\/a><\/p>\n<p><strong>Time: <\/strong>Thursday, Mar 30, 3pm ET<br \/><strong>Zoom: <\/strong><a href=\"https:\/\/gatech.zoom.us\/j\/8802082683\" target=\"_blank\" rel=\"noopener\">https:\/\/gatech.zoom.us\/j\/8802082683<\/a><strong><br \/><\/strong><br \/><strong>Speaker:<\/strong> <a href=\"https:\/\/sites.google.com\/view\/ruthluo\/\" target=\"_blank\" rel=\"noopener\">Ruth Luo<\/a>, University of South Carolina<br \/><strong>Title: <\/strong>A hypergraph analog of Dirac&#8217;s Theorem for 2-connected graphs<br \/><br \/><strong>Abstract: <\/strong>Every graph with minimum degree $k \\geq 2$ contains a cycle of length at least $k+1.$ Dirac proved that if the graph is also 2-connected then in fact we can find a cycle of length at least $min\\{2k, n\\}$. We prove a hypergraph version of this theorem: a minimum degree condition that forces the existence of long Berge cycles in 2-connected, uniform hypergraphs. This is joint work with Alexandr Kostochka and Grace McCourt.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>YouTube recording:\u00a0https:\/\/www.youtube.com\/watch?v=iIcl15EgNe4 Time: Thursday, Mar 30, 3pm ETZoom: https:\/\/gatech.zoom.us\/j\/8802082683Speaker: Ruth Luo, University of South CarolinaTitle: A hypergraph analog of Dirac&#8217;s Theorem for 2-connected graphs Abstract: Every graph with minimum degree $k \\geq 2$ contains a cycle of length at least &hellip; <a href=\"https:\/\/matroidunion.org\/?p=4827\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":21,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[11],"class_list":["post-4827","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\/4827","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\/21"}],"replies":[{"embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=4827"}],"version-history":[{"count":5,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4827\/revisions"}],"predecessor-version":[{"id":4843,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4827\/revisions\/4843"}],"wp:attachment":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4827"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=4827"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=4827"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}