The complement problem for linklessly embeddable graphs

DOI10.1142/S0218216522500754MaRDI QIDQ5050621zbMATH OpenFDO

Authors Ryan Odeneal, Ramin Naimi, Andrei Pavelescu, Elena Pavelescu

Publication date 17 November 2022

Published in Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

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

zbMATH Keywords

spatial graphgraph complementlinklessly embeddablede Verdière invariant

Mathematics Subject Classification ID

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

Recommendations

• On sum composite graphs and embedding problems
• scientific article; zbMATH DE number 861401
• scientific article; zbMATH DE number 125501
• Embedding the complement of a complete graph in a finite projective plane
• scientific article; zbMATH DE number 3857140
• On the complements of graphs
• Complementary _1-graphs embeddable in the half-cube
• On a conjecture of embeddable graphs
• scientific article; zbMATH DE number 4160754

Cites work

• scientific article; zbMATH DE number 3906521 (Why is no real title available?)
• A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
• A graph and its complement with specified properties. I: Connectivity
• A graph and its complement with specified properties. III: Girth and circumference
• A graph and its complement with specified properties. IV. Counting self-complementary blocks
• A splitter for graphs with no Petersen family minor
• Every planar graph with nine points has a nonplanar complement
• Generation of Triangulations of the Sphere
• Homomorphiesätze für Graphen
• Knots and links in spatial graphs
• Linkless embeddings of graphs in 3-space
• Most graphs are knotted
• Nordhaus-Gaddum problems for Colin de Verdière type parameters, variants of tree-width, and related parameters
• On the number of edges in maximally linkless graphs
• Practical graph isomorphism. II.
• 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
• The Non-Biplanar Character of the Complete 9-Graph
• The complement of a nIL graph with thirteen vertices is IL

Cited in

(7)

• The extremal function for bipartite linklessly embeddable graphs
• Intrinsically knotted graphs and connected domination
• An infinite family of linklessly embeddable Tutte-4-connected graphs
• On the number of edges in maximally linkless graphs
• Combing a Linkage in an Annulus
• The Complement Problem for Linklessly Embeddable Graphs
• New bounds on maximal linkless graphs

Describes a project that uses

Uses Software

• Traces
• nauty

This page was built for publication: The complement problem for linklessly embeddable graphs

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