Intersections of randomly embedded sparse graphs are Poisson
From MaRDI portal
Publication:1307020
zbMath0934.05116MaRDI QIDQ1307020
Edward A. Bender, E. Rodney Canfield
Publication date: 16 January 2000
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/120182
Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Asymptotic enumeration (05A16)
Related Items (1)
This page was built for publication: Intersections of randomly embedded sparse graphs are Poisson
