Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4657346 | Journal of Combinatorial Theory, Series B | 2008 | 18 Pages |
Abstract
We prove that if a sequence of graphs has (asymptotically) the same distribution of small subgraphs as a generalized random graph modeled on a fixed weighted graph H, then these graphs have a structure that is asymptotically the same as the structure of H. Furthermore, it suffices to require this for a finite number of subgraphs, whose number and size is bounded by a function of |V(H)|.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics