Intrinsically knotted and 4-linked directed graphs

DOI10.1142/S0218216518500372zbMATH Open1406.57001arXiv1702.06233OpenAlexW2964006355WikidataQ130118086 ScholiaQ130118086MaRDI QIDQ4565307FDOQ4565307

Authors: Joel Foisy, Thomas Fleming 

Publication date: 12 June 2018

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

Abstract: We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically 3-linked and 4-linked directed graphs. We introduce two operations, consistent edge contraction and H-cyclic subcontraction, as special cases of minors for digraphs, and show that the property of having a linkless embedding is closed under these operations. We analyze the relationship between the number of distinct knots and links in an undirected graph $G$ and its corresponding symmetric digraph $overlineDG$. Finally, we note that the maximum number of edges for a graph that is not intrinsically linked is $O(n)$ in the undirected case, but $O(n^2)$ for directed graphs.

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

Recommendations

• Intrinsically knotted graphs
• Intrinsically linked graphs with knotted components
• More intrinsically knotted graphs
• Intrinsic knotting and linking of complete graphs
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
• Intrinsic knotting and linking of almost complete graphs
• A newly recognized intrinsically knotted graph
• On intrinsically knotted or completely 3-linked graphs
• Intrinsic linking and knotting are arbitrarily complex in directed graphs
• 4-colored graphs and knot/link complements

zbMATH Keywords

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Cites Work

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

Cited In (5)

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

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

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