Intrinsic linking and knotting in tournaments

DOI10.1142/S0218216519500767zbMath1458.57022arXiv1901.03451OpenAlexW2974234671WikidataQ127226462 ScholiaQ127226462MaRDI QIDQ5215809

Joel Foisy, Thomas R. Fleming

Publication date: 13 February 2020

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

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

zbMATH Keywords

directed graphtournamentspatial graphintrinsically linked graphintrinsically \(n\)-linked graphintrinsically knotted graph

Mathematics Subject Classification ID

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 (1)

Classifying intrinsically linked tournaments by score sequence

Cites Work

• Unnamed Item
• On intrinsically knotted or completely 3-linked graphs
• Intrinsic linking in directed graphs
• Counting links in complete graphs
• Counting links and knots in complete graphs
• INTRINSICALLY LINKED GRAPHS WITH KNOTTED COMPONENTS
• Knots and links in spatial graphs
• Intrinsic linking and knotting are arbitrarily complex
• Intrinsically knotted graphs
• INTRINSICALLY n-LINKED GRAPHS
• Intrinsically knotted and 4-linked directed graphs
• GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING
• Intrinsic linking and knotting are arbitrarily complex in directed graphs
• Realization of knots and links in a spatial graph
• Intrinsically triple linked complete graphs

This page was built for publication: Intrinsic linking and knotting in tournaments