On embedding graphs in surfaces
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact M.Jenssen.
I will start explaining the two main problems concerning
embeddings of graphs in surfaces. Then I will explain Whitney’s characterisation of planarity in terms of abstract dual graphs from the 1930s. Can abstract duals also be used to construct embeddings in surfaces beyond the plane?
This talk is part of the Combinatorics and Probability Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|