{"id":3267,"date":"2020-10-22T11:59:50","date_gmt":"2020-10-22T15:59:50","guid":{"rendered":"http:\/\/matroidunion.org\/?p=3267"},"modified":"2020-10-27T13:51:07","modified_gmt":"2020-10-27T17:51:07","slug":"online-talk-rose-mccarty","status":"publish","type":"post","link":"https:\/\/matroidunion.org\/?p=3267","title":{"rendered":"Online talk: Rose McCarty"},"content":{"rendered":"\n<h5><strong>Monday, October 26,<\/strong> <strong>3pm ET<\/strong> (8pm BST, 8am Tue NZDT)<br \/><a href=\"http:\/\/www.math.uwaterloo.ca\/~rmmccart\/\"><strong>Rose McCarty<\/strong><\/a>, University of Waterloo<br \/><strong>Colouring pseudo-visibility graphs<br \/><a href=\"https:\/\/youtu.be\/D3zBZhs-Go8\">Youtube<\/a><\/strong><\/h5>\n<h5>\u00a0<\/h5>\n<h5>\u00a0<\/h5>\n<h5><b><\/b><strong>Abstract:<\/strong><\/h5>\n<p>The <em>visibility graph<\/em> of a finite set of points $S$ on a Jordan curve $\\mathcal{J}$ has vertex set $S$, and two points in $S$ are adjacent if the (open) segment between them is contained in the interior of $\\mathcal{J}$. To obtain a <em>pseudo-visibility graph<\/em>, we instead start with a pseudolinear drawing of the complete graph with vertex set $S$ on $\\mathcal{J}$. We show that any pseudo-visibility graph with clique number $\\omega$ is $\\left(3\\cdot 4^{\\omega-1}\\right)$-colourable. This talk will also focus on connections between 1) developing efficient algorithms for recognizing these graphs and 2) constructing uniform, rank-$3$ oriented matroids which represent the pseudolinear drawing.<\/p>\n<p>This is joint work with James Davies, Tomasz Krawczyk, and Bartosz Walczak.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Monday, October 26, 3pm ET (8pm BST, 8am Tue NZDT)Rose McCarty, University of WaterlooColouring pseudo-visibility graphsYoutube \u00a0 \u00a0 Abstract: The visibility graph of a finite set of points $S$ on a Jordan curve $\\mathcal{J}$ has vertex set $S$, and two &hellip; <a href=\"https:\/\/matroidunion.org\/?p=3267\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":19,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[11],"class_list":["post-3267","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\/3267","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\/19"}],"replies":[{"embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=3267"}],"version-history":[{"count":11,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/3267\/revisions"}],"predecessor-version":[{"id":3431,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/3267\/revisions\/3431"}],"wp:attachment":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=3267"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=3267"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=3267"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}