combinatorics / Permutational Ramsey theory

Dihedral and cyclic Ramsey numbers of the alternating 3-path

The a = 3 slice is settled outright. The parent conjecture's dihedral side has since been resolved for every a >= 4 as well (see the related entry), so Conjecture 4.9's claim 1 + (a-1)(b-1) now stands proved for all a >= 3; the trivial a = 1, 2 cases and the cyclic analogue for a >= 4 remain formally unaddressed.

5Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsAug 12, 2026Significance 5/100Registry: site confirmed

Dihedral and cyclic Ramsey numbers of the alternating 3-path

Prior state unknown→proved

The a = 3 slice is settled outright. The parent conjecture's dihedral side has since been resolved for every a >= 4 as well (see the related entry), so Conjecture 4.9's claim 1 + (a-1)(b-1) now stands proved for all a >= 3; the trivial a = 1, 2 cases and the cyclic analogue for a >= 4 remain formally unaddressed.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

The a = 3 slice is settled outright. The parent conjecture's dihedral side has since been resolved for every a >= 4 as well (see the related entry), so Conjecture 4.9's claim 1 + (a-1)(b-1) now stands proved for all a >= 3; the trivial a = 1, 2 cases and the cyclic analogue for a >= 4 remain formally unaddressed.

The a = 3 slice is settled outright. The parent conjecture's dihedral side has since been resolved for every a >= 4 as well (see the related entry), so Conjecture 4.9's claim 1 + (a-1)(b-1) now stands proved for all a >= 3; the trivial a = 1, 2 cases and the cyclic analogue for a >= 4 remain formally unaddressed.

Recorded attempts

Evidence graph

Connected research record