University of Cambridge > Talks.cam > Combinatorics Seminar > Graphs in locally 2-connected spaces

Graphs in locally 2-connected spaces

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

  • UserCarsten Thomassen (Technical University of Denmark)
  • ClockThursday 29 May 2008, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

It is well-known that the property of being locally connected simplifies the structure of a metric space considerably. Nevertheless, a complete description of the locally connected, compact metric spaces seems hopeless. However, a complete description becomes possible if we add the condition that the space does not contain an infinite complete graph and if we also strengthen the local connectivity condition to local 2-connectedness, that is, for every element x in the space, and every neighborhood U of x, there exists a neighborhood V of x contained in U such that both V and V-x are connected. Surprisingly, such a space must be locally 2-dimensional, that is, it is contained in a 2-dimensional surface. Some applications will be given.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity