Proves log c(G(n,d/n)) = π²/(6d) + o(d^{-1}) whp and gives matching lower plus weaker upper bound for log c(Q_d) on the hypercube.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Lipschitz Functions on Sparse Graphs II
Proves log c(G(n,d/n)) = π²/(6d) + o(d^{-1}) whp and gives matching lower plus weaker upper bound for log c(Q_d) on the hypercube.