Local central limit theorem for triangle counts in sparse random graphs

DOI10.1017/S0305004125101345MaRDI QIDQ6858786zbMATH OpenFDO

Authors Pedro Araújo, Letícia Mattos

Publication date 12 February 2026

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

zbMATH Keywords

Gilmer-Kopparty conjecture

Mathematics Subject Classification ID

Characteristic functions; other transforms (60E10) Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)

This page was built for publication: Local central limit theorem for triangle counts in sparse random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858786)