Growth Constants for Lipschitz Functions on Sparse Random Graphs
Prior state unknown→proved
Resolved the sharp constant (w.h.p.) for random graphs G(n, d/n)
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatorics / Combinatorics
Growth Constants for Lipschitz Functions on Sparse Random Graphs
Resolved the sharp constant (w.h.p.) for random graphs G(n, d/n)
9Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
Resolved the sharp constant (w.h.p.) for random graphs G(n, d/n)
Resolved the sharp constant (w.h.p.) for random graphs G(n, d/n)
Recorded attempts
Evidence graph
Connected research record
- →Resolved the sharp constant (w.h.p.) for random graphs G(n, d/n)
parent of · claim · theorem
- →Growth Constants for Lipschitz Functions on Sparse Random Graphs
parent of · event · claim reported