Most graphs are knotted

DOI10.1142/S0218216520710030MaRDI QIDQ4965619zbMATH OpenOpenAlexFDO

Authors Kazuhiro Ichihara, T. 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

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

Abstract: We present four models for a random graph and show that, in each case, the probability that a graph is intrinsically knotted goes to one as the number of vertices increases. We also argue that, for $kgeq18$, most graphs of order $k$ are intrinsically knotted and, for $kgeq2n+9$, most of order $k$ are not $n$-apex. We observe that $p(n)=1/n$ is the threshold for intrinsic knotting and linking in Gilbert's model.

Recommendations

• Intrinsic knotting and linking of almost complete graphs
• Intrinsic knotting and linking of complete graphs
• Intrinsically knotted and 4-linked directed graphs
• scientific article; zbMATH DE number 1218944
• More intrinsically knotted graphs

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3906521 (Why is no real title available?)
• scientific article; zbMATH DE number 3769674 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Every planar graph with nine points has a nonplanar complement
• Graphs on unlabelled nodes with a given number of edges
• Hadwiger numbers of self-complementary graphs
• Homomorphiesätze für Graphen
• Intrinsic knotting and linking of almost complete graphs
• Knots and links in spatial graphs
• Primitive spatial graphs and graph minors
• Probability Inequalities for Sums of Bounded Random Variables
• Random Graphs
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
• Sachs' linkless embedding conjecture
• The complement of a nIL graph with thirteen vertices is IL

Cited in

(2)

• The complement problem for linklessly embeddable graphs
• Most unbreakable murky graphs are bull-free

This page was built for publication: Most graphs are knotted

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