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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have