{"id":4748,"date":"2023-02-23T09:57:58","date_gmt":"2023-02-23T14:57:58","guid":{"rendered":"http:\/\/matroidunion.org\/?p=4748"},"modified":"2023-03-03T08:20:03","modified_gmt":"2023-03-03T13:20:03","slug":"online-talk-raphael-steiner-2","status":"publish","type":"post","link":"https:\/\/matroidunion.org\/?p=4748","title":{"rendered":"Online Talk: Raphael Steiner"},"content":{"rendered":"\n

YouTube recording: <\/strong>https:\/\/www.youtube.com\/watch?v=veVUV1Ti0Wc<\/a>

Time: <\/strong>Thursday, Mar 2, 3pm EST (8pm GMT, 9am Fri NZDT)
Zoom: <\/strong>https:\/\/gatech.zoom.us\/j\/8802082683<\/a>

Speaker:<\/strong> Raphael Steiner<\/a>, ETH Z\u00fcrich
Title: <\/strong>Coloring hypergraphs with excluded minors

Abstract: <\/strong>Hadwiger’s conjecture, among the most famous open problems in graph theory, states that every graph that does not contain $K_t$ as a minor is properly (<\/span>t<\/span>\u2212<\/span>1<\/span>)<\/span><\/span><\/span><\/span>-colorable. The purpose of this work is to demonstrate that a natural extension of Hadwiger’s problem to hypergraph coloring exists, and to derive some first partial results and applications. Generalizing ordinary graph minors to hypergraphs, we say that a hypergraph $H_1$<\/span> is a minor of a hypergraph $H_2$<\/span>, if a hypergraph isomorphic to $H_1$<\/span> can be obtained from $H_2$<\/span> via a finite sequence of vertex- and hyperedge-deletions, and hyperedge contractions. We first show that a weak extension of Hadwiger’s conjecture to hypergraphs holds true: For every\u00a0positive integer t, there exists a finite (smallest) integer\u00a0h<\/span>(<\/span>t<\/span>)<\/span><\/span><\/span><\/span> such that every hypergraph with no $K_t$-minor is h(t)-colorable, and we prove $$\\lceil 3\/2(t-1) \\rceil \\le h(t) \\le 2g(t)$$ where\u00a0g<\/span>(<\/span>t<\/span>)<\/span><\/span><\/span><\/span> denotes the maximum chromatic number of graphs with no $K_t$-minor. Using the recent result by Delcourt and Postle that $g(t) = O(t \\log\\log t)$, this yields $h(t) = O(t\\log\\log t)$. We further conjecture that $h(t) = \\lceil 3\/2(t-1) \\rceil$, i.e., that every hypergraph with no $K_t$-minor is $\\lceil 3\/2(t-1) \\rceil$-colorable for all t, and prove this conjecture for all hypergraphs with independence number at most\u00a02. By considering special classes of hypergraphs, the above additionally has some interesting applications for ordinary graph coloring, such as:
-graphs of chromatic number $Ckt\\log\\log t$ contain $K_t$-minors with\u00a0k<\/span><\/span><\/span><\/span>-edge-connected branch-sets,
-graphs of chromatic number $Cqt\\log\\log t$ contain $K_t$-minors with modulo-q<\/span><\/span><\/span><\/span>-connected branch sets,
-by considering cycle hypergraphs of digraphs we recover known results on strong minors in digraphs of large dichromatic number as special cases.<\/span><\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

YouTube recording: https:\/\/www.youtube.com\/watch?v=veVUV1Ti0Wc Time: Thursday, Mar 2, 3pm EST (8pm GMT, 9am Fri NZDT)Zoom: https:\/\/gatech.zoom.us\/j\/8802082683 Speaker: Raphael Steiner, ETH Z\u00fcrichTitle: Coloring hypergraphs with excluded minors Abstract: Hadwiger’s conjecture, among the most famous open problems in graph theory, states that every … Continue reading →<\/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-4748","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\/4748","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=4748"}],"version-history":[{"count":22,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4748\/revisions"}],"predecessor-version":[{"id":4778,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4748\/revisions\/4778"}],"wp:attachment":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4748"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=4748"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=4748"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}