Intrinsically linked graphs and even linking number
摘要
We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two component link with lk(A,L) = k2^r, k not 0, a non-split n-component link where all linking numbers are even, or an n-component link with components L, A_i where lk(L,A_i) = 3k, k not 0. Links with other properties are considered as well. For a given property, we prove that every embedding of a certain complete graph contains a link with that property. The size of the complete graph is determined by the property in question.
引用
@article{arxiv.math/0511133,
title = {Intrinsically linked graphs and even linking number},
author = {Thomas Fleming and Alexander Diesl},
journal= {arXiv preprint arXiv:math/0511133},
year = {2014}
}
备注
Published by Algebraic and Geometric Topology at http://www.maths.warwick.ac.uk/agt/AGTVol5/agt-5-55.abs.html