University of Birmingham > Talks@bham > Reading Group in Combinatorics and Probability > Tangles

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Tangles

Add 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Birmingham Popular Maths Lectures RSLC PhD/Postdoc Seminars (Chemistry) PIPS - Postgraduate Informal Physics Seminars

Other talks

The galaxy-halo connection in the cosmic web Post-mortem privacy – theory, law and technology School Seminar The Griess Algebra and the Monster Multi-dimensional vector assignment problems (MVA) : Complexity, Approximation and Algorithms The Large Mathieu Groups
 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.