Most graphs are knotted

DOI10.1142/S0218216520710030zbMath1459.05302arXiv1811.09726OpenAlexW3116853220MaRDI QIDQ4965619

Kazuhiro Ichihara, Thomas W. Mattman

Publication date: 6 March 2021

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

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

zbMATH Keywords

random graphsspatial graphsapex graphintrinsic knottingintrinsic linking

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (1)

The complement problem for linklessly embeddable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sachs' linkless embedding conjecture
• The complement of a nIL graph with thirteen vertices is IL
• Hadwiger numbers of self-complementary graphs
• Primitive spatial graphs and graph minors
• Homomorphiesätze für Graphen
• Graphs on unlabelled nodes with a given number of edges
• Knots and links in spatial graphs
• Probability Inequalities for Sums of Bounded Random Variables
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
• Random Graphs
• Every planar graph with nine points has a nonplanar complement

This page was built for publication: Most graphs are knotted