Intrinsically knotted and 4-linked directed graphs

DOI10.1142/S0218216518500372zbMath1406.57001arXiv1702.06233OpenAlexW2964006355WikidataQ130118086 ScholiaQ130118086MaRDI QIDQ4565307

Joel Foisy, Thomas R. Fleming

Publication date: 12 June 2018

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Related Items (3)

Intrinsic linking and knotting are arbitrarily complex in directed graphs ⋮ Classifying intrinsically linked tournaments by score sequence ⋮ Intrinsic linking and knotting in tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• On intrinsically knotted or completely 3-linked graphs
• Intrinsic linking in directed graphs
• Counting links in complete graphs
• Tournaments as strong subcontractions
• The extremal function for complete minors
• Sachs' linkless embedding conjecture
• Counting links and knots in complete graphs
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• INTRINSICALLY LINKED GRAPHS WITH KNOTTED COMPONENTS
• Knots and links in spatial graphs
• GRAPHS WITH A KNOT OR 3-COMPONENT LINK IN EVERY SPATIAL EMBEDDING
• Intrinsic linking and knotting are arbitrarily complex
• Intrinsically knotted graphs
• INTRINSICALLY n-LINKED GRAPHS
• Recent developments in spatial graph theory
• Realization of knots and links in a spatial graph
• Intrinsically triple linked complete graphs

This page was built for publication: Intrinsically knotted and 4-linked directed graphs