Pith. sign in

REVIEW

Bipartizing fullerenes

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 1106.0420 v1 pith:W4NLOUPY submitted 2011-06-02 math.CO

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

A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by removing O(sqrt{n}) edges. This bound is asymptotically optimal.

Discussion (0). Continue with ORCID to comment.

Pith tools