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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹī¸ Information

Graphs in locally 2-connected spaces

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Professor Natasa Milic-Frayling IPH Webinar (via Zoom online)

Other talks

Bacterial Physiology During Growth Arrest: Can It Be Targeted by Anti-Bacterial Therapeutics? Title TBC Talk TBC Morning Tea and Coffee Reproducibility In Astrophysical Simulations: The AGORA Initiative and a 14-Year Human Experiment (In Memory of Joel Primack) Title to be confirmed
 

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