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

Let $P$ be a finite set of points in general position in the plane. Thedisjointness graph of segments $D(P)$ of $P$ is the graph whose vertices areall the closed straight line segments with endpoints in $P$, two of which areadjacent in $D(P)$ if and only if they are disjoint. As usual, we use$\chi(D(P))$ to denote the chromatic number of $D(P)$, and use $d(n)$ to denotethe maximum $\chi(D(P))$ taken over all sets $P$ of $n$ points in generalposition in the plane. In this paper we show that $d(n)=n-2$ if and only if$n\in \{3,4,\ldots ,16\}$.

The Maximum Chromatic Number of the Disjointness Graph of Segments on $n$-point Sets in the Plane with $n\leq 16$