check
Combinatorics: Daniel Cizma (HUJI) | Einstein Institute of Mathematics

Combinatorics: Daniel Cizma (HUJI)

Date: 
Mon, 21/12/202011:00-13:00
Location: 
https://huji.zoom.us/j/87055312032?pwd=Yk9RbGRxdHdqS1lHVCt5KzhxNHNIZz09


HUJI Combinatorics Seminar 


When: Monday Dec 21st, 2020, at 11AM


Zoom link: 


https://huji.zoom.us/j/87055312032?pwd=Yk9RbGRxdHdqS1lHVCt5KzhxNHNIZz09

Speaker: Daniel Cizma (HUJI)

Title: Geodesic Geometry on Graphs


Abstract: 
In a graph G = (V, E) we consider a system of paths S so that for every two vertices u, v in V there is a unique uv path in S, P_uv. The path system is consistent if for every path P_uv in S and vertices x,y in P_uv the xy subpath of P_uv coincides with P_xy. 
We can ask the following questions: Does there exist a metric on G so that every path in S is shortest with respect to this metric? In particular, for which graphs is it always possible to find such a metric given any consistent path system? We say graphs with this property are metrizable.

In this talk, I will introduce and discuss the notion of graph metrizability. In particular, we will talk about what sorts of graphs are/aren't metrizable. 

Joint work with Nati Linial.