University of Birmingham > Talks@bham > Study group in Graph Theory, Topology and Algorithms > Crossing numbers of composite knots and spatial graphs

Crossing numbers of composite knots and spatial graphs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Johannes Carmesin.

The crossing number of a knot K is the minimal number of crossings in any knot diagram representing K. Despite this straightforward definition and its historical significance computing the crossing number of a knot is a big challenge, since there is no general procedure to decide whether a given diagram is minimal. In this talk I am going to discuss the question whether the crossing number is additive under the connected sum operation, a conjecture that remains open after more than 100 years. After a brief general introduction to the theory of knots and spatial graphs I will prove results about the crossing numbers of certain spatial graphs and show how these can be related to crossing numbers of knots.

This talk is part of the Study group in Graph Theory, Topology and Algorithms series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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.