An intrinsic non-triviality of graphs

Details An intrinsic non-triviality of graphs An intrinsic non-triviality of graphs

2008-04-26

arxiv.org/abs/0804.4229v3

Mathematics

Geometric Topology

11 pages, 13 figures

Scientific paper

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of the graph contains a non-splittable 2-component link. We also show that there exists a graph such that every spatial embedding of the graph contains either a non-splittable 3-component link or an irreducible spatial handcuff graph whose constituent 2-component link is split.

Affiliated with

Also associated with

No associations

Rating

An intrinsic non-triviality of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An intrinsic non-triviality of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An intrinsic non-triviality of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-43533