Intrinsic linking and knotting are arbitrarily complex in directed graphs

DOI10.4064/ba210704-8-7zbMath1490.05103arXiv1901.01212OpenAlexW3209139661MaRDI QIDQ5035316

Thomas W. Mattman, Benjamin Pagano, Ramin Naimi

Publication date: 21 February 2022

Published in: Bulletin of the Polish Academy of Sciences Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

directed graphspatial graphintrinsically linked graphintrinsically knotted graph

Mathematics Subject Classification ID

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) Directed graphs (digraphs), tournaments (05C20) Knot theory (57K10)

Related Items (2)

Classifying intrinsically linked tournaments by score sequence ⋮ Intrinsic linking and knotting in tournaments

Cites Work

• Unnamed Item
• Knots and links in spatial graphs
• Intrinsic linking and knotting are arbitrarily complex
• Intrinsically knotted and 4-linked directed graphs

This page was built for publication: Intrinsic linking and knotting are arbitrarily complex in directed graphs