Integrity report for The upper bound on number of graphs, with fixed number of vertices, that vertices can be colored with n colors

A machine-verified record of the checks Pith has run against this paper: detector runs, findings, signed bundle events, and canonical identifiers.

arXiv:math/0310485

Paper page arXiv integrity.json

Detector runs

Findings

Signed record

The machine-readable record for this paper lives at /pith/math/0310485/integrity.json. Pith Number bundles also include signed pith.integrity.v1 events where a Pith Number exists.