{"id":9148,"date":"2023-05-24T01:43:43","date_gmt":"2023-05-23T23:43:43","guid":{"rendered":"https:\/\/www.dm.unipi.it\/eventi\/vertex-labeling-properties-on-simplicial-complexes-bruno-benedetti-university-of-miami\/"},"modified":"2023-05-26T17:55:53","modified_gmt":"2023-05-26T15:55:53","slug":"vertex-labeling-properties-on-simplicial-complexes-bruno-benedetti-university-of-miami","status":"publish","type":"unipievents","link":"https:\/\/www.dm.unipi.it\/en\/eventi\/vertex-labeling-properties-on-simplicial-complexes-bruno-benedetti-university-of-miami\/","title":{"rendered":"Vertex labeling properties on simplicial complexes &#8211; Bruno Benedetti (University of Miami)"},"content":{"rendered":"<h4>Venue<\/h4>\n<p>Department of Mathematics, Aula Magna.<\/p>\n<h4 class='mt-4'>Abstract<\/h4>\n<p>Hamiltonian graphs are graphs where one can find a closed walk that touches all&nbsp;vertices exactly once. Equivalently, they are the graphs whose vertices can be labeled from&nbsp;1 to n so that all of &nbsp;12, 23, 34, \u2026, n1 &nbsp;feature among the edges. This second definition has&nbsp;the advantage that it can be extended to simplicial complexes of dimension higher than one.&nbsp;Similarly, one can extend to complexes many other famous properties of graph theory (like chordality or being interval) which can be characterized via vertex labelings.&nbsp;<br \/>We extend to all dimensions the&nbsp;famous result that all unit-interval 2-connected graphs are Hamiltonian. If time permits, we&nbsp;also discuss how to characterize unit-interval graphs and complexes in algebraic terms (i.e.&nbsp;in terms of Groebner bases of determinantal ideals). &nbsp;<br \/>This is joint work with Matteo Varbaro and Lisa Seccia.&nbsp;<\/p>\n<p class='mt-4'>Further information is available on the <a href=\"https:\/\/events.dm.unipi.it\/event\/194\/\">event page<\/a> on the Indico platform.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Hamiltonian graphs are graphs where one can find a closed walk that touches all\u00a0vertices exactly once. Equivalently, they are the graphs whose vertices can be labeled from\u00a01 to n so that all of \u00a012, 23, 34, \u2026, n1 \u00a0feature among the edges. This&hellip;<\/p>\n<p><a class=\"btn btn-dark btn-sm unipi-read-more-link\" href=\"https:\/\/www.dm.unipi.it\/en\/eventi\/vertex-labeling-properties-on-simplicial-complexes-bruno-benedetti-university-of-miami\/\">Read More&#8230;<\/a><\/p>\n","protected":false},"author":6,"featured_media":0,"template":"","tags":[],"unipievents_taxonomy":[],"class_list":["post-9148","unipievents","type-unipievents","status-publish","hentry"],"acf":[],"unipievents_startdate":1685545200,"unipievents_enddate":1685548800,"unipievents_place":"Department of Mathematics, Aula Magna.","unipievents_externalid":194,"jetpack_sharing_enabled":true,"publishpress_future_workflow_manual_trigger":{"enabledWorkflows":[]},"_links":{"self":[{"href":"https:\/\/www.dm.unipi.it\/en\/wp-json\/wp\/v2\/unipievents\/9148","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.dm.unipi.it\/en\/wp-json\/wp\/v2\/unipievents"}],"about":[{"href":"https:\/\/www.dm.unipi.it\/en\/wp-json\/wp\/v2\/types\/unipievents"}],"author":[{"embeddable":true,"href":"https:\/\/www.dm.unipi.it\/en\/wp-json\/wp\/v2\/users\/6"}],"version-history":[{"count":1,"href":"https:\/\/www.dm.unipi.it\/en\/wp-json\/wp\/v2\/unipievents\/9148\/revisions"}],"predecessor-version":[{"id":9150,"href":"https:\/\/www.dm.unipi.it\/en\/wp-json\/wp\/v2\/unipievents\/9148\/revisions\/9150"}],"wp:attachment":[{"href":"https:\/\/www.dm.unipi.it\/en\/wp-json\/wp\/v2\/media?parent=9148"}],"wp:term":[{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.dm.unipi.it\/en\/wp-json\/wp\/v2\/tags?post=9148"},{"taxonomy":"unipievents_taxonomy","embeddable":true,"href":"https:\/\/www.dm.unipi.it\/en\/wp-json\/wp\/v2\/unipievents_taxonomy?post=9148"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}