A note on cycle lengths in graphs of chromatic number five and six

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 2104.01382 v1 pith:HOZ7SX7U submitted 2021-04-03 math.CO

Qingyi Huo This is my paper · ORCID

classification math.CO

keywords lengthsnotechromaticcontainscriticalcyclecyclesevery

verification ladder T0 review T1 audit T2 compute T3 formal

No signed human review yet.

0 comments

abstract

In this note, we prove that every non-complete $(k+1)$-critical graph contains cycles of all lengths modulo $k$, where $k=4,5$.