Pith. sign in

REVIEW 1 cited by

On Alternating 6-Cycles in Edge-Coloured Graphs

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 2505.09809 v2 pith:UBDADCCI submitted 2025-05-14 math.CO cs.DM

Hao Chen , Jonathan A. Noel This is my paper · ORCID
classification math.COcs.DM
keywords alternatingcolouringcyclesalgebrasasymptoticallybasitbluecase
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this short note, we use flag algebras to prove that the number of colour alternating 6-cycles in a red/blue colouring of a large clique is asymptotically maximized by a uniformly random colouring. This settles the first open case of a problem of Basit, Granet, Horsley, K\"undgen and Staden.

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. The semi-inducibility of the blue--blue--red path on four vertices

    math.CO 2026-07 accept novelty 7.0 of 10

    The maximum asymptotic density of semi-induced blue-blue-red paths on four vertices is p*, attained by a large clique together with an asymptotically regular component.

Pith tools