Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Joel Foisy"'
Autor:
Joel Foisy, Thomas Fleming
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 sequences. While many distinct tournaments may have the same score sequence,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::919b1b648bd7d5da10672acfb464fcb5
http://arxiv.org/abs/2009.06565
http://arxiv.org/abs/2009.06565
Autor:
Madeleine Burkhart, Joel Foisy
Publikováno v:
Involve 11, no. 2 (2018), 195-206
We investigate spherical links: that is, disjoint embeddings of 1-spheres and 0-spheres in the 2-sphere, where the notion of a split link is analogous to the usual concept. In the quest to enumerate distinct nonsplit [math] -links for arbitrary [math
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3523d0f89c5570418d684d4ba0574614
https://doi.org/10.2140/involve.2018.11.195
https://doi.org/10.2140/involve.2018.11.195
Publikováno v:
Involve, a Journal of Mathematics. 10:1-20
Flapan--Naimi--Pommersheim showed that every spatial embedding of $K_{10}$, the complete graph on ten vertices, contains a non-split three-component link; that is, $K_{10}$ is intrinsically triple-linked in $\mathbb{R}^3$. The work of Bowlin--Foisy a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5cde43cd386ebf327c506a77d89499f
https://doi.org/10.2140/involve.2017.10.1
https://doi.org/10.2140/involve.2017.10.1
Autor:
Joel Foisy, Thomas Fleming
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 o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a07474257db1cc2971a0ab44a93e9482
Autor:
Joel Foisy
Publikováno v:
Notices of the American Mathematical Society. 67:1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::882a6e8e9d9ae881e3ad0c74bc65780e
https://doi.org/10.1090/noti2140
https://doi.org/10.1090/noti2140
Autor:
Joel Foisy
Publikováno v:
Journal of Knot Theory and Its Ramifications. 15:1113-1118
We describe a family of graphs that contain a knot or a non-split 3-component link in every spatial embedding. We exhibit a graph in this family that has a knotless embedding, and a 3-component linkless embedding.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a3f6eeb864ffec3e2b8335d0a915a91
https://doi.org/10.1142/s0218216506004993
https://doi.org/10.1142/s0218216506004993
Autor:
Joel Foisy
Publikováno v:
Journal of Graph Theory. 54:115-124
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f467ccfa3d1f51ae54159c2147fb1305
https://doi.org/10.1002/jgt.20200
https://doi.org/10.1002/jgt.20200
Autor:
Garry Bowlin, Joel Foisy
Publikováno v:
Journal of Knot Theory and Its Ramifications. 13:1021-1027
In [2], it was shown that every spatial embedding of K10, the complete graph on ten vertices, contains a non-split 3-component link (K10 is intrinsically 3-linked). We improve this result by exhibiting two different subgraphs of K10 that also have th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7a496e91a2c460cf42df689624940fea
https://doi.org/10.1142/s0218216504003652
https://doi.org/10.1142/s0218216504003652
Autor:
Stephan Chan, Katherine Sharrow, Joel Foisy, Jennifer Hespen, Trent Lalonde, Quincy Loney, Nathan Thomas, Eman Kunz, Anton Dochtermann
Publikováno v:
Journal of Knot Theory and Its Ramifications. 13:737-748
We exhibit a graph, G12, that in every spatial embedding has a pair of non-splittable 2 component links sharing no vertices or edges. Surprisingly, G12 does not contain two disjoint copies of graphs known to have non-splittable links in every embeddi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5e27ae1c169c0ef9e339f1c23961acf
https://doi.org/10.1142/s0218216504003421
https://doi.org/10.1142/s0218216504003421
Autor:
Joel Foisy
Publikováno v:
Journal of Graph Theory. 43:199-209
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e88e07c7e51ef4d9912ecbd5ba65d1bd
https://doi.org/10.1002/jgt.10114
https://doi.org/10.1002/jgt.10114