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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A drawing of a graph in the plane is {\it pseudolinear} if the edges of thedrawing can be extended to doubly-infinite curves that form an arrangement ofpseudolines, that is, any pair of edges crosses precisely once. A special caseare {\it rectilinear} drawings where the edges of the graph are drawn asstraight line segments. The rectilinear (pseudolinear) crossing number of agraph is the minimum number of pairs of edges of the graph that cross in any ofits rectilinear (pseudolinear) drawings. In this paper we describe an ongoingproject to continuously obtain better asymptotic upper bounds on therectilinear and pseudolinear crossing number of the complete graph $K_n$.

An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants