An intrinsic non-triviality of graphs - Mathematics > Geometric TopologyReportar como inadecuado




An intrinsic non-triviality of graphs - Mathematics > Geometric Topology - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We say that a graph is intrinsically non-trivial if every spatial embeddingof the graph contains a non-trivial spatial subgraph. We prove that anintrinsically non-trivial graph is intrinsically linked, namely every spatialembedding of the graph contains a non-splittable 2-component link. We also showthat there exists a graph such that every spatial embedding of the graphcontains either a non-splittable 3-component link or an irreducible spatialhandcuff graph whose constituent 2-component link is split.



Autor: Ryo Nikkuni

Fuente: https://arxiv.org/







Documentos relacionados