| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777082 | Electronic Notes in Discrete Mathematics | 2017 | 7 Pages |
Abstract
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on analytic combinatorics and on the notion of patchwork to describe the possible overlapping of copies.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gwendal Collet, Ãlie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana,