Katalin Vesztergombi

According to our database, Katalin Vesztergombi authored at least 10 papers between 1979 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of one.

2013

Non-Deterministic Graph Property Testing.

László Lovász, Katalin Vesztergombi

Comb. Probab. Comput., 2013

2012

Nondeterministic graph property testing

László Lovász, Katalin Vesztergombi

CoRR, 2012

2011

Limits of randomly grown graph sequences.

Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Katalin Vesztergombi

Eur. J. Comb., 2011

2006

Graph limits and parameter testing.

Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

1996

The two largest distances in finite planar sets.

Katalin Vesztergombi

Discret. Math., 1996

1989

On the Graph of Large Distance.

Paul Erdös, László Lovász, Katalin Vesztergombi

Discret. Comput. Geom., 1989

1987

On large distances in planar sets.

Katalin Vesztergombi

Discret. Math., 1987

1986

Discrepancy of Set-systems and Matrices.

László Lovász, Joel Spencer, Katalin Vesztergombi

Eur. J. Comb., 1986

1985

On the distribution of distances in finite sets in the plane.

Katalin Vesztergombi

Discret. Math., 1985

1979

Some remarks on the chromatic number of the strong product of graphs.

Katalin Vesztergombi

Acta Cybern., 1979