{"id":4594,"date":"2022-02-22T00:34:51","date_gmt":"2022-02-22T05:34:51","guid":{"rendered":"http:\/\/matroidunion.org\/?p=4594"},"modified":"2022-03-01T14:49:22","modified_gmt":"2022-03-01T19:49:22","slug":"online-talk-louis-esperet","status":"publish","type":"post","link":"https:\/\/matroidunion.org\/?p=4594","title":{"rendered":"Online Talk: Louis Esperet"},"content":{"rendered":"\n<p><strong>Tuesday, March 1,<\/strong> <strong>11am<\/strong><strong>\u00a0ET<\/strong> (4pm GMT, 5am Wed NZDT)<br \/><strong><a href=\"https:\/\/oc.g-scop.grenoble-inp.fr\/esperet\/\">Louis Esperet<\/a><\/strong>, G-SCOP Laboratory (CNRS, Grenoble)<br \/><strong>Packing and covering balls in planar graphs<\/strong><\/p>\n<div><strong>YouTube: <\/strong><a href=\"https:\/\/youtu.be\/lHwCeQADLFg\">https:\/\/youtu.be\/lHwCeQADLFg<\/a><\/div>\n<h5>\u00a0<\/h5>\n<h5><strong>Abstract:<br \/><\/strong>The set of all vertices at distance at most $r$ from a vertex $v$ in a graph $G$ is called an $r$-ball. We prove that the minimum number of vertices hitting all $r$-balls in a planar graph $G$ is at most a constant (independent of $r$) times the maximum number of vertex-disjoint $r$-balls in $G$. This was conjectured by Estellon, Chepoi and Vax\u00e8s in 2007. Our result holds more generally for any proper minor-closed class, and for systems of balls of arbitrary (and possibly distinct) radii.<\/h5>\n<h5>\u00a0<\/h5>\n<h5>Joint work with N. Bousquet, W. Cames van Batenburg, G. Joret, W. Lochet, C. Muller, and F. Pirot.<\/h5>\n","protected":false},"excerpt":{"rendered":"<p>Tuesday, March 1, 11am\u00a0ET (4pm GMT, 5am Wed NZDT)Louis Esperet, G-SCOP Laboratory (CNRS, Grenoble)Packing and covering balls in planar graphs YouTube: https:\/\/youtu.be\/lHwCeQADLFg \u00a0 Abstract:The set of all vertices at distance at most $r$ from a vertex $v$ in a graph &hellip; <a href=\"https:\/\/matroidunion.org\/?p=4594\">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-4594","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\/4594","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=4594"}],"version-history":[{"count":2,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4594\/revisions"}],"predecessor-version":[{"id":4600,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4594\/revisions\/4600"}],"wp:attachment":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4594"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=4594"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=4594"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}