{"id":4459,"date":"2021-11-17T19:45:41","date_gmt":"2021-11-18T00:45:41","guid":{"rendered":"http:\/\/matroidunion.org\/?p=4459"},"modified":"2021-11-25T23:29:52","modified_gmt":"2021-11-26T04:29:52","slug":"online-talk-tom-kelly","status":"publish","type":"post","link":"https:\/\/matroidunion.org\/?p=4459","title":{"rendered":"Online Talk: Tom Kelly"},"content":{"rendered":"\n<p><strong>Tuesday, Nov 23,<\/strong> <strong>3:30pm ET<\/strong> (8:30pm GMT, 9:30am Wed NZDT)<br \/><strong><a href=\"http:\/\/web.mat.bham.ac.uk\/T.Kelly\/\">Tom Kelly<\/a><\/strong>, University of Birmingham<br \/><strong>Coloring hypergraphs of small codegree, and a proof of the Erd\u0151s\u2013Faber\u2013Lov\u00e1sz conjecture<\/strong><\/p>\n<div><b>YouTube: <\/b><a href=\"https:\/\/youtu.be\/bSsFKFtRuVc\">https:\/\/youtu.be\/bSsFKFtRuVc<\/a><\/div>\n<h5>\u00a0<\/h5>\n<h5><strong>Abstract:<\/strong><\/h5>\n<h5>The theory of edge-coloring hypergraphs has a rich history with important connections and application to other areas of combinatorics e.g. design theory and combinatorial geometry. A long-standing problem in the field is the Erd\u0151s\u2013Faber\u2013Lov\u00e1sz conjecture (posed in 1972), which states that the chromatic index of any linear hypergraph on $n$ vertices is at most $n$. In joint work with Dong Yeap Kang, Daniela K\u00fchn, Abhishek Methuku, and Deryk Osthus, we proved this conjecture for every sufficiently large $n$. Recently, we also solved a related problem of Erd\u0151s from 1977 on the chromatic index of hypergraphs of small codegree. In this talk, I will survey the history behind these results and discuss some aspects of the proofs.<\/h5>\n","protected":false},"excerpt":{"rendered":"<p>Tuesday, Nov 23, 3:30pm ET (8:30pm GMT, 9:30am Wed NZDT)Tom Kelly, University of BirminghamColoring hypergraphs of small codegree, and a proof of the Erd\u0151s\u2013Faber\u2013Lov\u00e1sz conjecture YouTube: https:\/\/youtu.be\/bSsFKFtRuVc \u00a0 Abstract: The theory of edge-coloring hypergraphs has a rich history with important &hellip; <a href=\"https:\/\/matroidunion.org\/?p=4459\">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-4459","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\/4459","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=4459"}],"version-history":[{"count":4,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4459\/revisions"}],"predecessor-version":[{"id":4482,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4459\/revisions\/4482"}],"wp:attachment":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4459"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=4459"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=4459"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}