![]() |
![]() |
TanglesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Felix Joos. We investigate so-called tangles. This notion locates high-connected parts in graphs. This talk is part of the Reading Group in Combinatorics and Probability series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsReading Group in Combinatorics and Probability Optimisation and Numerical Analysis Seminars Physics and Astronomy ColloquiaOther talksHunt for an Earth-twin TBA Ultrafast Spectroscopy and Microscopy as probes of Energy Materials TBA TBA Counting cycles in planar graphs |