arXiv · 0804.4229
An intrinsic non-triviality of graphs
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ryo Nikkuni. 2009-02-01. An intrinsic non-triviality of graphs. https://doi.org/10.2140/agt.2009.9.351
Cite the original work for its findings. Save a collection to share your selection of sources.