Pith. sign in

REVIEW 2 cited by

Grid-drawings of graphs in three-dimensions

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.02369 v2 pith:WMMOBVRX submitted 2024-04-03 math.CO cs.DM

Jozsef Balogh , Ethan Patrick White This is my paper · ORCID
classification math.COcs.DM
keywords drawneverygraphgraphsgrid-drawingsvolumeaspectbounded
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Using probabilistic methods, we obtain grid-drawings of graphs without crossings with low volume and small aspect ratio. We show that every $D$-degenerate graph on $n$ vertices can be drawn in $[m]^3$ where $m^3 = O(D^2 n\log n)$. In particular, every graph of bounded maximum degree can be drawn in a grid with volume $O(n \log n)$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A note on the no-$(d+2)$-on-a-sphere problem

    math.CO 2024-12 conditional novelty 7.0 of 10

    A new construction gives subsets of the d-dimensional lattice cube of size n^{3/(d+1)-o(1)} with no d+2 points on a sphere or hyperplane, improving Thiele's 1995 bound.

  2. On subsets of lattice cubes avoiding affine and spherical degeneracies

    math.CO 2025-09 conditional novelty 6.0 of 10

    New lower bounds for lattice sets avoiding subspheres and subspaces, including f_circ(n) ≥ 7n/12, via deletion-method counting of cyclic quadrilaterals and cospherical tuples.

Pith tools