Intrinsic linking and knotting in tournaments

11 Jan 2019 Fleming Thomas Foisy Joel

A directed graph $G$ is $\textit{intrinsically linked}$ 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 $\textit{tournament}$ is a directed graph where each pair of vertices is connected by exactly one directed edge... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • GEOMETRIC TOPOLOGY
  • COMBINATORICS