A universal point set is a set of points that can be used as the vertices for straight-line drawings of every $n$-vertex planar graph. We still don't know how big they have to be – the best lower bounds are only a little more than $n$ while the best upper bounds are quadratic – but now the best lower bounds are a little bigger than they were thanks to this new preprint by Scheucher, Schrezenmaier, and Steiner: arxiv.org/abs/1811.06482

A Mastodon instance for maths people. The kind of people who make $\pi z^2 \times a$ jokes.

Use $ and $ for inline LaTeX, and $ and $ for display mode.