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

A drawing of a graph is said to be a {\em straight-line drawing} if thevertices of $G$ are represented by distinct points in the plane and every edgeis represented by a straight-line segment connecting the corresponding pair ofvertices and not passing through any other vertex of $G$. The minimum number ofslopes in a straight-line drawing of $G$ is called the slope number of $G$. Weshow that every cubic graph can be drawn in the plane with straight-line edgesusing only the four basic slopes $\{0,\pi/4,\pi/2,-\pi/4\}$. We also prove thatfour slopes have this property if and only if we can draw $K_4$ with them.  Given a graph $G$, an {\em obstacle representation} of $G$ is a set of pointsin the plane representing the vertices of $G$, together with a set of obstacles(connected polygons) such that two vertices of $G$ are joined by an edge if andonly if the corresponding points can be connected by a segment which avoids allobstacles. The {\em obstacle number} of $G$ is the minimum number of obstaclesin an obstacle representation of $G$. We show that there are graphs on $n$vertices with obstacle number $\Omega({n}/{\log n})$.  We show that there is an $m=2n+o(n)$, such that, in the Maker-Breaker gameplayed on $\Z^d$ where Maker needs to put at least $m$ of his marksconsecutively in one of $n$ given winning directions, Breaker can force a drawusing a pairing strategy. This improves the result of Kruczek and Sundberg whoshowed that such a pairing strategy exits if $m\ge 3n$. A simple argument showsthat $m$ has to be at least $2n+1$ if Breaker is only allowed to use a pairingstrategy, thus the main term of our bound is optimal.

Obstacles, Slopes, and Tic-Tac-Toe: An excursion in discrete geometry and combinatorial game theory