Intrinsically projectively linked graphs

MaRDI QIDQ6402055zbMATH OpenFDO

Authors Joel Foisy, Luis Ángel Topete Galván, Evan Knowles, Uriel Alejandro Nolasco, Yuanyuan Shen, Lucy Wickham

Publication date 14 June 2022

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Knot theory (57K10) Relations of low-dimensional topology with graph theory (57M15)

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

This page was built for publication: Intrinsically projectively linked graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402055)