The complement of a nIL graph with thirteen vertices is IL

DOI10.2140/AGT.2020.20.395MaRDI QIDQ1985998zbMATH OpenOpenAlexFDO

Authors Andrei Pavelescu, Elena 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 complementlinklessly embeddablede Verdière graph invariant

Mathematics Subject Classification ID

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

Abstract: We show that for any simple non-oriented graph G with at least thirteen vertices either G or its complement is intrinsically linked.

Cites work

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

Cited in

(2)

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

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

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