BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Nati Linial (Hebrew University of Jerusalem)
DTSTART:20201221T140000Z
DTEND:20201221T150000Z
DTSTAMP:20260423T035533Z
UID:EPC/38
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/38/">Geo
 desic geometry on graphs</a>\nby Nati Linial (Hebrew University of Jerusal
 em) as part of Extremal and probabilistic combinatorics webinar\n\n\nAbstr
 act\nWe investigate a graph theoretic analog of geodesic geometry. In a gr
 aph G=(V\,E) we consider a system of paths $P=\\{Pu\,v | u\,v \\in V\\}$ w
 here $Pu\,v$ connects vertices u and v. This system is consistent in that 
 if vertices y\,z are in $Pu\,v$\, then the sub-path of $Pu\,v$ between the
 m coincides with $Py\,z$. A map $w:E \\to (0\,\\infty)$ is said to induce 
 P if for every $u\,v \\in V$ the path $Pu\,v$ is w-geodesic. We say that G
  is metrizable if every consistent path system is induced by some such w. 
 As we show\, metrizable graphs are very rare\, whereas there exist infinit
 ely many 2-connected metrizable graphs.\n\n\nJoint work with my student Da
 niel Cizma\n
LOCATION:https://researchseminars.org/talk/EPC/38/
END:VEVENT
END:VCALENDAR