Source authenticated

The Laplacian Sn,nS_{n,n} conjecture

True: no simple graph on n≥2n \ge 2 vertices has Laplacian spectrum {0,1,…,n−1}\{0,1,\ldots,n-1\}. The paper closes the range left between the two previously settled regimes, n≤15n \le 15 and n≥6 649 688 933n \ge 6\,649\,688\,933.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Sep 22, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: The Laplacian $S_{n,n}$ conjecture · Laplacian $S_{n,n}$ conjecture

Confidence: Not scored

Registry verification: unreviewed · preprint · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

ChatGPT-6 Astra
model · ai model contributor · OpenAI

Nathaniel Johnston
human · human collaborator

Lineage and corrections

This event attributed to ChatGPT-6 Astra

The Laplacian Sn,nS_{n,n} conjecture evidence for this event

The Laplacian Sn,nS_{n,n} conjecture parent of this event

VibeMathed record: The Laplacian Sn,nS_{n,n} conjecture evidence for this event

This event attributed to Nathaniel Johnston

True: no simple graph on n≥2n \ge 2 vertices has Laplacian spectrum {0,1,…,n−1}\{0,1,\ldots,n-1\}. The paper closes the range left between the two previously settled regimes, n≤15n \le 15 and n≥6 649 688 933n \ge 6\,649\,688\,933. parent of this event

Act on this frontier

Verify, challenge, or extend the result.