Pith. sign in

REVIEW

Sublinear separators in intersection graphs of convex shapes

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 2001.01552 v1 pith:OT4NCV7X submitted 2020-01-06 math.CO

Zdenek Dvorak , Rose McCarty , Sergey Norin This is my paper · ORCID
classification math.CO
keywords sublinearintersectionseparatorsconditionconvexgraphsargumentbalanced
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We give a natural sufficient condition for an intersection graph of compact convex sets in R^d to have a balanced separator of sublinear size. This condition generalizes several previous results on sublinear separators in intersection graphs. Furthermore, the argument used to prove the existence of sublinear separators is based on a connection with generalized coloring numbers which has not been previously explored in geometric settings.

Discussion (0). Continue with ORCID to comment.

Pith tools