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

Determining whether there exists a graph such that its crossing number andpair crossing number are distinct is an important open problem in geometricgraph theory. We show that $\textit{cr}(G)=O(\mathop{\mathrm{pcr}}(G)^{3/2})$for every graph $G$, this improves the previous best bound by a logarithmicfactor. Answering a question of Pach and T\'oth, we prove that the bisectionwidth (and, in fact, the cutwidth as well) of a graph $G$ with degree sequence$d_1,d_2,\dots,d_n$ satisfies$\mathop{\mathrm{bw}}(G)=O\big(\sqrt{\mathop{\mathrm{pcr}}(G)+\sum_{k=1}^nd_k^2}\big)$. Then we show that there is a constant $C\geq 1$ such that thefollowing holds: For any graph $G$ of order $n$ and any set $S$ of at least$n^C$ points in general position on the plane, $G$ admits a straight-linedrawing which maps the vertices to points of $S$ and has no more than$O\left(\log n\cdot\left(\mathop{\mathrm{pcr}}(G)+\sum_{k=1}^nd_k^2\right)\right)$ crossings. Our proofs rely on a modified version of aseparator theorem for string graphs by Lee, which might be of independentinterest.

Pair crossing number, cutwidth, and good drawings on arbitrary point sets