Non-deterministic graph property testing

László Lovász, Katalin Vesztergombi

Research output: Contribution to journalArticle

8 Citations (Scopus)


A property of finite graphs is called non-deterministically testable if it has a 'certificate' such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificates that consist of one or more unary and/or binary relations on the nodes, in the case of dense graphs. Using the theory of graph limits, we prove that non-deterministically testable properties are also deterministically testable.

Original languageEnglish
Pages (from-to)749-762
Number of pages14
JournalCombinatorics Probability and Computing
Issue number5
Publication statusPublished - Sep 1 2013

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Non-deterministic graph property testing'. Together they form a unique fingerprint.

  • Cite this