Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.


hagman
Posts:
1,923
Registered:
1/29/05


Re: Graph theory/topology query
Posted:
Aug 16, 2012 4:42 PM


Am Donnerstag, 16. August 2012 22:26:50 UTC+2 schrieb hagman: > Am Donnerstag, 16. August 2012 16:22:08 UTC+2 schrieb Bill Taylor: > > > I am looking at planar graphs that might have distinct, > > > > > > i.e. nonhomotopic, embeddings into the sphere. > > > > > > > > > > > > It is easy to construct counterexamples with > > > > > > 2 distinct embeddings, but they seem to be > > > > > > very simply connected. Are there any connectivity > > > > > > or other conditions known that guarantee > > > > > > monoembeddability? > > > > One such condition (probably there are less extreme ones): > > If a graph G is maximal planar (if G' is G plus an > > arbitrary edge then G' is not planar), then G > > is "monoembeddable". >
I just red in Wikipedia that 3connectivity is sufficient for mono.embeddability
hagman



