The probability that a random multigraph is simple
Svante Janson
Abstract
Consider a random multigraph G* with given vertex degrees d1,...,dn, contructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges (d1+...+dn)/2 tending to infinity, the probability that the multigraph is simple stays away from 0 if and only if Σ di2=O(Σ di). This was previously known only under extra assumtions on the maximum degree. We also give an asymptotic formula for this probability, extending previous results by several authors.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.