Intrinsic linking and knotting in tournaments

DOI10.1142/S0218216519500767zbMATH Open1458.57022arXiv1901.03451OpenAlexW2974234671WikidataQ127226462 ScholiaQ127226462MaRDI QIDQ5215809FDOQ5215809

Authors: Joel Foisy, Thomas Fleming 

Publication date: 13 February 2020

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

Abstract: A directed graph $G$ is $extitintrinsicallylinked$ if every embedding of that graph contains a non-split link $L$, where each component of $L$ is a consistently oriented cycle in $G$. A $extittournament$ is a directed graph where each pair of vertices is connected by exactly one directed edge. We consider intrinsic linking and knotting in tournaments, and study the minimum number of vertices required for a tournament to have various intrinsic linking or knotting properties. We produce the following bounds: intrinsically linked ($n=8$), intrinsically knotted ($9leqnleq12$), intrinsically 3-linked ($10leqnleq23$), intrinsically 4-linked ($12leqnleq66$), intrinsically 5-linked ($15leqnleq154$), intrinsically $m$-linked ($3mleqnleq8(2m-3{)}^2$), intrinsically linked with knotted components ($9leqnleq107$), and the disjoint linking property ($12leqnleq14$). We also introduce the $extitconsistencygap$, which measures the difference in the order of a graph required for intrinsic $n$-linking in tournaments versus undirected graphs. We conjecture the consistency gap to be non-decreasing in $n$, and provide an upper bound at each $n$.

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

Recommendations

• Intrinsically knotted and 4-linked directed graphs
• Intrinsically linked graphs and even linking number
• Intrinsic linking in directed graphs
• Intrinsic linking and knotting are arbitrarily complex in directed graphs
• Highly linked tournaments

zbMATH Keywords

directed graphtournamentspatial 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) Knot theory (57K10)

Cites Work

• Knots and links in spatial graphs
• Realization of knots and links in a spatial graph
• 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
• Intrinsically linked graphs with knotted components
• Intrinsically knotted graphs
• Counting links and knots in complete graphs
• GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING
• Intrinsic linking and knotting are arbitrarily complex in directed graphs
• Intrinsically knotted and 4-linked directed graphs

Cited In (2)

• Classifying intrinsically linked tournaments by score sequence
• Intrinsic linking in directed graphs

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

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