Feige's Hypergraph Moore-Bound Conjecture
At the conjectured density, must every $k$-uniform hypergraph contain a short nontrivial even cover - a set of hyperedges covering each vertex an even number of times - with no superfluous polylogarithmic factors? Known up to polylog factors since 2022; now proved exactly for every $k \ge 3$.
Exact FrontierDelta
Scope and record
Occurred: Jul 17, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. Imported under CC BY 4.0.
Canonical aliases: Feige's Hypergraph Moore-Bound Conjecture · Hypergraph Moore bound
Confidence: Not scored
Registry verification: unreviewed · preprint · resolved
Attribution
VibeMathed
registry · event recorded by
GPT-5.6 Sol
model · ai model contributor · OpenAI / Anthropic
GPT-5.5 Pro
model · ai model contributor · OpenAI / Anthropic
Claude Opus 4.8
model · ai model contributor · OpenAI / Anthropic
Claude Fable 5
model · ai model contributor · OpenAI / Anthropic
Lineage and corrections
This event attributed to Claude Fable 5
This event attributed to Claude Opus 4.8
This event attributed to GPT-5.5 Pro
This event attributed to GPT-5.6 Sol