FormalizationCombinatoricsErdős #34
Erdős problem #34
Formalization of an existing proof. Contribution type: Formalization.
LFCR
Frontier
New proofs, counterexamples, bounds and formalizations reported by people and AI systems, newest first.
February 2026 40
FormalizationCombinatoricsErdős #648
Erdős problem #648
Formalization of an existing proof. Contribution type: Formalization.
LFCR
FormalizationCombinatoricsErdős #497
Erdős problem #497
Formalization of an existing proof. Contribution type: Formalization.
LFCR
FormalizationCombinatoricsErdős #443
Erdős problem #443
Formalization of an existing proof. Contribution type: Formalization.
LFCR
FormalizationCombinatoricsErdős #435
Erdős problem #435
Formalization of an existing proof. Contribution type: Formalization.
LFCR
Literature foundCombinatoricsErdős #1150
Erdős problem #1150
Claimed solution found (likely incorrect). Contribution type: Literature search.
LFCR
Partial resultCombinatoricsErdős #943
Erdős problem #943
Partial result. Contribution type: AI collaborating with humans.
LFCR
FormalizationCombinatoricsErdős #947
Erdős problem #947
Formalization of an existing proof. Contribution type: Formalization.
LFCR
New proofCombinatoricsErdős #659
Erdős problem #659
Full solution. Contribution type: AI alongside literature.
LFCR
Literature foundCombinatoricsErdős #652
Erdős problem #652
Full solution by applying literature results. Contribution type: Literature search.
LFCR
FormalizationCombinatoricsErdős #505
Erdős problem #505
Formalization of an existing proof. Contribution type: Formalization.
LFCR
FormalizationCombinatoricsErdős #502
Erdős problem #502
Formalization of an existing proof. Contribution type: Formalization.
LFCR
New proofCombinatoricsErdős #397
Erdős problem #397
Full solution. Contribution type: AI alongside literature.
LFCR
New proofCombinatoricsErdős #1153
Erdős problem #1153
Full solution. Contribution type: AI collaborating with humans.
LFCR
Partial resultCombinatoricsErdős #1132
Erdős problem #1132
Partial result. Contribution type: AI collaborating with humans.
LFCR
New proofTheoretical computer scienceGemini case 8.5
Networked information aggregation
Case 8.5 in the Gemini Deep Think research report (convergence bound).
LFCR
New proofTheoretical computer scienceGemini case 8.4
Revelation-principle domain extension
Case 8.4 in the Gemini Deep Think research report (hypothesis dependent extension).
LFCR
New proofTheoretical computer scienceGemini case 8.3
Self-regularized Gumbel sigmoid
Case 8.3 in the Gemini Deep Think research report (optimization analysis).
LFCR
New proofTheoretical computer scienceGemini case 8.2
Ratio difference maximization
Case 8.2 in the Gemini Deep Think research report (hardness reduction).
LFCR
New proofTheoretical computer scienceGemini case 8.1.2
Unsymmetrized / Li–Médard assertions
Case 8.1.2 in the Gemini Deep Think research report (scoped proof).
LFCR
New proofTheoretical computer scienceGemini case 8.1.1
Courtade–Kumar high-noise regime
Case 8.1.1 in the Gemini Deep Think research report (partial result).
LFCR
New proofTheoretical computer scienceGemini case 7.5
Entropy, low-rank and Chamfer streaming
Case 7.5 in the Gemini Deep Think research report (multiple algorithmic bounds).
LFCR
New proofTheoretical computer scienceGemini case 7.4
Streaming submodular maximization
Case 7.4 in the Gemini Deep Think research report (analysis with hypothesis correction).
LFCR
New proofTheoretical computer scienceGemini case 7.3
Robust coresets
Case 7.3 in the Gemini Deep Think research report (construction bound).
LFCR
New proofTheoretical computer scienceGemini case 7.2
Local-search query complexity
Case 7.2 in the Gemini Deep Think research report (bounds).
LFCR
New proofTheoretical computer scienceGemini case 7.1
Biclique partitions
Case 7.1 in the Gemini Deep Think research report (bounds).
LFCR
New proofTheoretical computer scienceGemini case 6.1
Cosmic-string spectral integrals
Case 6.1 in the Gemini Deep Think research report (closed form derivation).
LFCR
New proofTheoretical computer scienceGemini case 5.1
Search versus decision in S₂ᴾ
Case 5.1 in the Gemini Deep Think research report (algorithmic research).
LFCR
New proofTheoretical computer scienceGemini case 4.3
Regular bipartite perfect matchings
Case 4.3 in the Gemini Deep Think research report (bounds with prior literature corrections).
LFCR
New proofTheoretical computer scienceGemini case 4.2
Steiner-tree graph embeddings
Case 4.2 in the Gemini Deep Think research report (conjecture specific proof).
LFCR
New proofTheoretical computer scienceGemini case 4.1
Max-Cut geometry
Case 4.1 in the Gemini Deep Think research report (supporting lemma).
LFCR
New proofTheoretical computer scienceGemini case 3.2
SNARG proof bug
Case 3.2 in the Gemini Deep Think research report (proof error detection).
LFCR
CounterexampleTheoretical computer scienceGemini case 3.1
Submodular welfare
Case 3.1 in the Gemini Deep Think research report (counterexample).
LFCR
Literature foundCombinatoricsErdős #992
Erdős problem #992
Full solution found. Contribution type: Literature search.
LFCR
Partial resultCombinatoricsErdős #935
Erdős problem #935
Solution to one part of problem. Contribution type: AI alongside literature.
LFCR
Partial resultCombinatoricsErdős #75
Erdős problem #75
Solution to variant problem (implicit in literature). Contribution type: AI standalone.
LFCR
Literature foundCombinatoricsErdős #705
Erdős problem #705
Full solution found. Contribution type: Literature search.
LFCR
Partial resultCombinatoricsErdős #654
Erdős problem #654
Partial result. Contribution type: AI standalone.
LFCR
Literature foundCombinatoricsErdős #591
Erdős problem #591
Full solution found. Contribution type: Literature search.
LFCR
FormalizationCombinatoricsErdős #399
Erdős problem #399
Formalization of an existing proof. Contribution type: Formalization.
LFCR