14 citations · 26 across the 3 of their papers we have counts for
3 papers
math.CO2012★ 10 cited
Nondeterministic graph property testing
László Lovász, Katalin Vesztergombi
A property of finite graphs is called nondeterministically testable if it has a "certificate" such that once the certificate is specified, its correctness can be verified by random…
math.CO2009★ 2 cited
Limits of randomly grown graph sequences
C. Borgs, J. Chayes, L. Lovász +2
Motivated in part by various sequences of graphs growing under random rules (like internet models), convergent sequences of dense graphs and their limits were introduced by Borgs,…
math.CO2007★ 14 cited
Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing
C. Borgs, J. T. Chayes, L. Lovasz +2
We consider sequences of graphs and define various notions of convergence related to these sequences: ``left convergence'' defined in terms of the densities of homomorphisms from s…