Gilmer–Kopparty local central limit theorem conjecture
Statement
Let be a fixed connected graph, let be the Erdős–Rényi random graph, and let denote the number of copies of in . Define . If satisfies and , then satisfies a local central limit theorem: writing , , and , one has as .
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.