János Pach
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
János Pach has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
A. Frieze
1 shared publicationA.D. Barbour
1 shared publication- Andras Hajnal
Rutgers University
1 shared publication Andrew Thomason
1 shared publication- Anthony J.W. Hilton
University of Reading, Reading, RG6 6AX, England, UK
1 shared publication - Bernard Chazelle
Princeton University
1 shared publication
Latest Publications
- 22 May 1997
- Published by Cambridge University Press (CUP)
Combinatorics, Geometry and Probability
Paul Erdös was one of the greatest mathematicians of this century, known the world over for his brilliant ideas and stimulating questions. On the date of his 80th birthday a conference was held in his honour at Trinity College, Cambridge. Many leading combinatorialists attended. Their subsequent contributions are collected here. The areas represented range from set theory and geometry, through graph theory, group theory and combinatorial probability, to randomised algorithms and statistical physics. Erdös himself was able to give a survey of recent progress made on his favourite problems. Consequently this volume, consisting of in-depth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today.
- 22 May 1997
- Published by Cambridge University Press (CUP)
Combinatorics, Geometry and Probability
Paul Erdös was one of the greatest mathematicians of this century, known the world over for his brilliant ideas and stimulating questions. On the date of his 80th birthday a conference was held in his honour at Trinity College, Cambridge. Many leading combinatorialists attended. Their subsequent contributions are collected here. The areas represented range from set theory and geometry, through graph theory, group theory and combinatorial probability, to randomised algorithms and statistical physics. Erdös himself was able to give a survey of recent progress made on his favourite problems. Consequently this volume, consisting of in-depth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today.
- Open Access
Uniformly distributed distances: A geometric application of Jansen's inequality
Let $d_1\leq d_2\leq\ldots\leq d_{n\choose 2}$ denote the distances determined by $n$ points in the plane. It is shown that $\min\sum_i (d_{i+1}-d_i)^2=O(n^{-6/7})$, where the minimum is taken over all point sets with minimal distance $d_1 \geq 1$. This bound is asymptotically tight.Open AccessUniformly distributed distances: A geometric application of Jansen's inequality
Let $d_1\leq d_2\leq\ldots\leq d_{n\choose 2}$ denote the distances determined by $n$ points in the plane. It is shown that $\min\sum_i (d_{i+1}-d_i)^2=O(n^{-6/7})$, where the minimum is taken over all point sets with minimal distance $d_1 \geq 1$. This bound is asymptotically tight. - 1 June 1995
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 13 (1) , 459-468
A left-first search algorithm for planar graphs
- 1 June 1995
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 13 (1) , 459-468
A left-first search algorithm for planar graphs
- 1 July 1994
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 12 (1) , 1-7
Some geometric applications of Dilworth’s theorem
- 1 July 1994
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 12 (1) , 1-7
Some geometric applications of Dilworth’s theorem
- 1 March 1994
- Published by Springer Nature in Combinatorica
- Vol. 14 (1) , 121-125
The complexity of a class of infinite graphs
- 1 March 1994
- Published by Springer Nature in Combinatorica
- Vol. 14 (1) , 121-125
The complexity of a class of infinite graphs
- Open Access
- 1 July 1993
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 10 (2) , 143-155
How hard is half-space range searching?
- 1 July 1993
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 10 (2) , 143-155
Open AccessHow hard is half-space range searching?