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 -Y exchanges to K7-2e. We prove that for a nonouter-projective-planar graph G, G+K2 is IPL and describe the necessary and sufficient conditions on a projective planar graph G such that G+K2 is IPL. Lastly, we deduce conditions for f(G + K2) to have no nonsplit link, where G is projective planar, K2 = \w0,w1\, and f(G + K2) is the embedding onto RP3 with f(G) in z=0, w0 above z=0, and w1 below z=0 such that every edge connecting w0,w1 to G avoids the boundary of the 3-ball, whose antipodal points are identified to obtain projective space.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…