The complement of a nIL graph with thirteen vertices is IL

DOI10.2140/agt.2020.20.395zbMath1437.57024arXiv1810.11113OpenAlexW3105155554MaRDI QIDQ1985998

Elena Pavelescu, Andrei Pavelescu

Publication date: 7 April 2020

Published in: Algebraic \& Geometric Topology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.11113

zbMATH Keywords

intrinsically linkedgraph complementde Verdière graph invariantlinklessly embeddable

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Knot theory (57K10)

Related Items (2)

The complement problem for linklessly embeddable graphs ⋮ Most graphs are knotted

Cites Work

• The Colin de Verdière number and sphere representations of a graph
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Knots and links in spatial graphs
• A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
• Linkless embeddings of graphs in 3-space
• Every planar graph with nine points has a nonplanar complement

This page was built for publication: The complement of a nIL graph with thirteen vertices is IL