3 citations · 4 across the 11 of their papers we have counts for
7 papers · 1 filter
Classifying Intrinsically Linked Tournaments by Score Sequence
Thomas Fleming, Joel Foisy
A tournament on 8 or more vertices may be intrinsically linked as a directed graph. We begin the classification of intrinsically linked tournaments by examining their score sequenc…
Intrinsic linking and knotting in tournaments
Thomas Fleming, Joel Foisy
A directed graph is if every embedding of that graph contains a non-split link , where each component of is a consistently oriented cycle…
Intrinsically Knotted and 4-Linked Directed Graphs
Thomas Fleming, Joel Foisy
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 eve…
Intrinsically triple-linked graphs in RP^3
Joel Foisy, Jared Federman, Kristin McNamara +1
Flapan--Naimi--Pommersheim showed that every spatial embedding of , the complete graph on ten vertices, contains a non-split three-component link; that is, is intr…
Intrinsically Linked Graphs in Projective Space
Joel Foisy, Jason Bustamante, Jared Federman +5
We examine graphs that contain a non-trivial link in every embedding into real projective space, using a weaker notion of unlink than was used by Flapan, et al. We call such graphs…
Correction to ``Knotted Hamiltonian cycles in spatial embeddings of complete graphs"
Joel Foisy
We state and prove a correct version of a theorem presented in an earlier paper.