Pith. sign in

REVIEW 1 cited by

A strengthening on consecutive odd cycles in graphs of given minimum degree

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 2410.00648 v2 pith:RLAOV7KD submitted 2024-10-01 math.CO

Hao Lin , Guanghui Wang , Wenling Zhou This is my paper · ORCID
classification math.CO
keywords consecutivecyclesconjecturedegreelengthsminimumcombinconfirm
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Liu and Ma [J. Combin. Theory Ser. B, 2018] conjectured that every $2$-connected non-bipartite graph with minimum degree at least $k+1$ contains $\lceil k/2\rceil $ cycles with consecutive odd lengths. In particular, they showed that this conjecture holds when $k$ is even. In this paper, we confirm this conjecture for any $k\in \mathbb N$. Moreover, we also improve some previous results about cycles of consecutive lengths.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Interpolating chromatic and homomorphism thresholds

    math.CO 2025-02 conditional novelty 8.0 of 10

    The authors determine the exact VC-dimension-interpolated homomorphism thresholds for cliques and prove the blowup threshold of odd cycles C_{2k-1} is 1/(2k-1).

Pith tools