{"id":4579,"date":"2022-02-10T17:26:31","date_gmt":"2022-02-10T22:26:31","guid":{"rendered":"http:\/\/matroidunion.org\/?p=4579"},"modified":"2022-02-17T00:48:10","modified_gmt":"2022-02-17T05:48:10","slug":"online-talk-chun-hung-liu","status":"publish","type":"post","link":"https:\/\/matroidunion.org\/?p=4579","title":{"rendered":"Online Talk: Chun-Hung Liu"},"content":{"rendered":"\n<p><strong>Tuesday, Feb 15,<\/strong> <strong>4<\/strong><strong>pm ET<\/strong> (9pm GMT, 10am Wed NZDT)<br \/><strong><a href=\"https:\/\/www.math.tamu.edu\/~chliu\/\">Chun-Hung Liu<\/a><\/strong>, Texas A&amp;M University<br \/><strong>Homomorphism counts in robustly sparse graphs<\/strong><\/p>\n<div><strong>YouTube: <\/strong><a href=\"https:\/\/youtu.be\/iIFri6hTQ3E\">https:\/\/youtu.be\/iIFri6hTQ3E<\/a><\/div>\n<h5>\u00a0<\/h5>\n<h5><strong>Abstract:<\/strong><\/h5>\n<h5>For a fixed graph $H$ and for arbitrarily large host graphs $G$, the number<br \/>of homomorphisms from $H$ to $G$ and the number of subgraphs isomorphic to $H$<br \/>contained in $G$ have been extensively studied when the host graphs are<br \/>allowed to be dense. This talk addresses the case when the host graphs<br \/>are robustly sparse. We determine, up to a constant multiplicative<br \/>error, the maximum number of subgraphs isomorphic to $H$ contained in an<br \/>$n$-vertex graph in any fixed hereditary graph class with bounded<br \/>expansion. This result solves a number of open questions and can be<br \/>generalized to counting the number of homomorphisms.<br \/><br \/><\/h5>\n","protected":false},"excerpt":{"rendered":"<p>Tuesday, Feb 15, 4pm ET (9pm GMT, 10am Wed NZDT)Chun-Hung Liu, Texas A&amp;M UniversityHomomorphism counts in robustly sparse graphs YouTube: https:\/\/youtu.be\/iIFri6hTQ3E \u00a0 Abstract: For a fixed graph $H$ and for arbitrarily large host graphs $G$, the numberof homomorphisms from $H$ &hellip; <a href=\"https:\/\/matroidunion.org\/?p=4579\">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-4579","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\/4579","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=4579"}],"version-history":[{"count":5,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4579\/revisions"}],"predecessor-version":[{"id":4590,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4579\/revisions\/4590"}],"wp:attachment":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4579"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=4579"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=4579"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}