English

Intrinsically projectively linked graphs

Combinatorics 2022-06-15 v1 Geometric Topology

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 ΔY\Delta-Y exchanges to K72eK_{7}-2e. We prove that for a nonouter-projective-planar graph GG, G+Kˉ2G+\bar{K}_{2} is IPL and describe the necessary and sufficient conditions on a projective planar graph GG such that G+Kˉ2G+\bar{K}_{2} is IPL. Lastly, we deduce conditions for f(G+K2ˉ)f(G + \bar{K_{2}}) to have no nonsplit link, where GG is projective planar, K2ˉ={w0,w1}\bar{K_{2}} = \{w_{0},w_{1}\}, and f(G+K2ˉ)f(G + \bar{K_{2}}) is the embedding onto RP3\mathbb{R}P^{3} with f(G)f(G) in z=0z=0, w0w_{0} above z=0z=0, and w1w_{1} below z=0z=0 such that every edge connecting w0,w1{w_{0},w_{1}} to GG 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}
}
R2 v1 2026-06-24T11:50:50.085Z