Follow

I have another new SoCG preprint, "Cubic planar graphs that cannot be drawn on few lines" (arxiv.org/abs/1903.05256) and another new blog post describing it (11011110.github.io/blog/2019/0).

@11011110 Does it improve upon lower bounds on the rectilinear crossing number of, say \(K_{n,n}\) ?

@dimpase Not that I know of. It's entirely about planar graphs.

Sign in to participate in the conversation
Mathstodon

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.