An intrinsic non-triviality of graphs

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-43533

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.