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
Korsky, Saffat and Aiylam bounded the growth constant $c(G)$ for integer-valued Lipschitz functions on $G(n,d/n)$ between $1/(2d)$ and $4\log^2 d/d$ up to lower-order terms. The random-graph side is sharpened.
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
Korsky, Saffat and Aiylam bounded the growth constant $c(G)$ for integer-valued Lipschitz functions on $G(n,d/n)$ between $1/(2d)$ and $4\log^2 d/d$ up to lower-order terms. The random-graph side is sharpened.
Resolved the sharp constant (w.h.p.) for random graphs G(n, d/n)
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.