Intersections of randomly embedded sparse graphs are Poisson

MaRDI QIDQ1307020zbMATH OpenFDO

Authors 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, http://www.emis.de/journals/EJC/Volume_6/Abstracts/v6i1r36.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

complete graphfalling momentsPoisson distributionrandom embeddingspanning tree

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Trees (05C05) Enumeration in graph theory (05C30) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Central limit and other weak theorems (60F05)

Recommendations

• Random trees in a graph and trees in a random graph
• Poisson convergence of numbers of vertices of a given degree in random graphs
• An improved upper bound on the density of universal random graphs
• An improved upper bound on the density of universal random graphs
• scientific article; zbMATH DE number 3904623
• On the Maximum Degree of a Random Planar Graph
• scientific article; zbMATH DE number 747032
• On the number of subtrees for almost all graphs
• scientific article; zbMATH DE number 3891422

Cited in

(1)

• Unions of random trees and applications

This page was built for publication: Intersections of randomly embedded sparse graphs are Poisson

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