English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Fleming and Foisy recently proved the existence of a digraph whose everyembedding contains a $4$-component link, and left open the possibility that adirected graph with an intrinsic $n$-component link might exist. We show that,indeed, this is the case. In fact, much as Flapan, Mellor, and Naimi show forgraphs, knotting and linking are arbitrarily complex in directed graphs.Specifically, we prove the analog for digraphs of the main theorem of theirpaper: for any $n$ and $\alpha$, every embedding of a sufficiently largecomplete digraph in $\mathbb{R}^3$ contains an oriented link with components$Q_1, \ldots, Q_n$ such that, for every $i \neq j$, $|\mathrm{lk}(Q_i,Q_j)|\geq \alpha$ and $|a_2(Q_i)| \geq \alpha$, where $a_2(Q_i)$ denotes the secondcoefficient of the Conway polynomial of $Q_i$.

Intrinsic linking and knotting are arbitrarily complex in directed graphs