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)|. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1016/j.jctb.2007.06.005 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
finite number,quasirandom graph,homomorphism,small subgraphs,generalized random graph,generalized quasirandom graph,fixed weighted graph h,graph algebra,convergent graph sequence,graph homomorphism | Discrete mathematics,Combinatorics,Outerplanar graph,Comparability graph,Random graph,Line graph,Graph homomorphism,Distance-hereditary graph,Symmetric graph,Universal graph,Mathematics | Journal |
Volume | Issue | ISSN |
98 | 1 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
18 | 1.31 | 6 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
László Lovász | 1 | 791 | 152.09 |
Vera T. Sós | 2 | 318 | 62.21 |