A lower bound for 4-regular planar unit distance graphs

REVIEW

Not yet reviewed by Pith; the record is open.

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 1401.4377 v1 pith:IMFNDQNT submitted 2014-01-17 math.CO

Sascha Kurz This is my paper · ORCID

classification math.CO

keywords bounddistancelowerregularunitexhaustivegraphgraphs

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We perform an exhaustive search for the minimum 4-regular unit distance graph resulting in a lower bound of 34 vertices.