论文信息 - Generalized quasirandom graphs

Generalized quasirandom graphs

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)|.

László Lovász | Vera T. Sós

[1] L. Lovasz,et al. Reflection positivity, rank connectivity, and homomorphism of graphs , 2004, math/0404468.

[2] Miklós Simonovits,et al. Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs , 2003, Combinatorics, Probability and Computing.

[3] László Lovász,et al. The rank of connection matrices and the dimension of graph algebras , 2004, Eur. J. Comb..

[4] Fan Chung Graham,et al. Quasi-random graphs , 1988, Comb..

[5] V. Sós,et al. Counting Graph Homomorphisms , 2006 .

[6] László Lovász,et al. Limits of dense graph sequences , 2004, J. Comb. Theory B.

[7] László Lovász,et al. Contractors and connectors of graph algebras , 2005, J. Graph Theory.

[8] A. Thomason. Pseudo-Random Graphs , 1987 .

[9] Miklós Simonovits,et al. Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs , 1997, Comb..

[10] Miklós Simonovits,et al. Szemerédi's Partition and Quasirandomness , 1991, Random Struct. Algorithms.

[11] P. Valtr,et al. Topics in Discrete Mathematics , 2006 .

[12] V. Sós,et al. Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.