For every odd t≥17, the paper’s explicit circulant graph on 5t−10 vertices is doubly saturated and R(3,t)-good.
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
For every odd t≥17, the paper’s explicit circulant graph on 5t−10 vertices is doubly saturated and R(3,t)-good. Open residue: Odd t≥17; test successive t and seek a uniform modular proof.
Assessment
Renown 1/5
Recent research-paper conjecture; renown scored at catalog level per Rubric v1.
Attackability 5/5
The construction is explicit; each t reduces to exact clique/independence and edge/nonedge saturation checks.
- finite witness
- 4/5
- oracle cost
- 4/5
- freshness
- 5/5
- seedability
- 5/5
Verification note
Verify the circulant adjacency rule, enumerate forbidden cliques and independent sets, and check every toggle orbit. — Current arXiv revision checked; source-stated open/partial. Independent literature and author confirmation still required. Editorially screened candidate; not independently certified open. Author confirmation pending.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.