Pith. sign in

REVIEW

5-choosability of graphs with crossings far apart

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 1201.3014 v3 pith:DIIGB2LK submitted 2012-01-14 math.CO

Zdenek Dvorak , Bernard Lidicky , Bojan Mohar This is my paper · ORCID
classification math.CO
keywords crossingseveryapartchoosablegraphallowchoosabilitydistance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We give a new proof of the fact that every planar graph is 5-choosable, and use it to show that every graph drawn in the plane so that the distance between every pair of crossings is at least 15 is 5-choosable. At the same time we may allow some vertices to have lists of size four only, as long as they are far apart and far from the crossings.

Discussion (0). Continue with ORCID to comment.

Pith tools