Intrinsically projectively linked graphs
Joel Foisy, Luis \'Angel Topete Galv\'an, Evan Knowles, Uriel, Alejandro Nolasco, Yuanyuan Shen, Lucy Wickham

TL;DR
This paper investigates intrinsically projectively linked graphs, identifying new minimal examples, establishing conditions for their existence, and analyzing embeddings in projective space to understand linking properties.
Contribution
It determines the nonexistence of minor-minimal IPL graphs on 16 edges, finds new minimal IPL graphs via $ riangle$-Y exchanges, and characterizes conditions for IPL in projective planar graphs.
Findings
No minor-minimal IPL graphs on 16 edges exist.
New minor-minimal IPL graphs identified through $ riangle$-Y exchanges.
Conditions for $f(G + ar{K_{2}})$ to have no nonsplit link established.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Advanced Antenna and Metasurface Technologies
