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

We study the following problem introduced by Dujmovic et al. Given a tree $T= (V,E)$, on $n$ vertices, a set of $n$ lines $\mathcal{L}$ in the plane and abijection $\iota: V \rightarrow \mathcal{L}$, we are asked to find acrossing-free straight-line embedding of $T$ so that $v\in \iota(v)$, for all$v\in V$. We say that a set of $n$ lines $\mathcal{L}$ is universal for treesif for any tree $T$ and any bijection $\iota$ there exists such an embedding.We prove that any sufficiently big set of lines is not universal for trees,which solves an open problem asked by Dujmovic et al.

On Sets of Lines Not-Supporting Trees