Erdős·erdos:745
Erdős Problem 745: Second-largest component of a random graph
No independent check recorded yet. A formal artifact, declaration or published object is attached, but no rebuild of it is recorded here.
Fidelity F2: The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
graph theory·Source
AI activity
How grades workNo AI contribution recorded against this statement.
Fidelity
How fidelity is gradedF2 declared. The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
Declared by the projects
1As each project's formalization.yaml states it.
Erdős 745: corrected sparse random-graph evolution atlas
- authors
- Jingxuan Ding
- method
- agent
- review
- self-assessed
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- results
- 1 main results named, checked with Comparator, with an alignment table
- sources
- On the Evolution of Random Graphs — background; On Tree Census and the Giant Component in Sparse Random Graphs — background; Component Behavior Near the Critical Point of the Random Graph Process — adapts; Brownian Excursions, Critical Random Graphs and the Multiplicative Coalescent — adapts
- divergences
- Exact-rate correction to the near-critical quadratic normalization; fixed-edge and finite-rank critical statement rather than an unrestricted graph-process or full l² limit theorem. See stage8/CLAIM_LEDGER.md.
- checked by
- nobody independent of its authors yet
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themFormal material
Formal statements · 1
Also known as · 3
- https://www.erdosproblems.com/745
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/745.lean
- FormalConjectures/ErdosProblems/745.lean
Cite this record
qed.bot, “Erdős Problem 745: Second-largest component of a random graph”, https://qed.bot/s/erdos-745, as of 20 Nov 2026.