Intrinsically projectively linked graphs
Abstract
A graph is intrinsically projectively linked (IPL) if its every embedding in projective space contains a nonsplit link. Some minor-minimal IPL graphs have been found previously. We determine that no minor-minimal IPL graphs on 16 edges exists and identify new minor-minimal IPL graphs by applying exchanges to . We prove that for a nonouter-projective-planar graph , is IPL and describe the necessary and sufficient conditions on a projective planar graph such that is IPL. Lastly, we deduce conditions for to have no nonsplit link, where is projective planar, , and is the embedding onto with in , above , and below such that every edge connecting to avoids the boundary of the 3-ball, whose antipodal points are identified to obtain projective space.
Keywords
Cite
@article{arxiv.2206.06877,
title = {Intrinsically projectively linked graphs},
author = {Joel Foisy and Luis Ángel Topete Galván and Evan Knowles and Uriel Alejandro Nolasco and Yuanyuan Shen and Lucy Wickham},
journal= {arXiv preprint arXiv:2206.06877},
year = {2022}
}