János Pach

Discrete Mathematics and Combinatorics · 2000–2014

A researcher in the Science corpus: 15 papers; trusts 8 researchers and is trusted by 8 researchers here, as inferred from the citation graph.

Subfields

• Discrete Mathematics and Combinatorics — 12 citations into it; #1,500 of 2,017 by trust here, #1,251 by citations
• Computational Theory and Mathematics — 10 citations into it
• Geometry and Topology — 10 citations into it
• Computer Graphics and Computer-Aided Design — 9 citations into it; #806 of 1,584 by trust here, #976 by citations
• Applied Mathematics — 5 citations into it; #6,714 of 7,620 by trust here, #7,414 by citations

Whom János Pach trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Jørgen Bang-Jensen
2. Jirí Matousek
3. David Conlon
4. Gregory Z. Gutin
5. David Haussler
6. Larry Guth
7. L. Lov'asz
8. Pankaj Kumar Agarwal
9. Peter Kuchment
10. Jacob Fox

Who trusts János Pach overall

1. Nathael Gozlan
2. Alex Iosevich
3. Peter Keevash
4. Jacob Fox
5. Stefan Felsner
6. Cyril Roberto
7. Guy Moshkovitz
8. Larry Guth
9. Sariel Har-Peled
10. Adam W. Marcus

Papers from János Pach's perspective

Ordered by how strongly the researchers János Pach trusts endorse each paper. Same corpus, a different order for every researcher.

1. A combinatorial problem in geometry
2. Lectures on discrete geometry
3. A new upper bound for diagonal Ramsey numbers
4. Digraphs - theory, algorithms and applications
5. The early evolution of the H-free process
6. Sphere Packing Numbers for Subsets of the Boolean n-Cube with Bounded Vapnik-Chervonenkis Dimension
7. Sparse partition universal graphs for graphs of bounded degree
8. Hypergraph Ramsey numbers
9. Geometric Range Searching and Its Relatives
10. A Ramsey-type theorem for bipartite graphs

Their papers

• Forbidden paths and cycles in ordered graphs and matrices (2006) — 102 citations
• Separator theorems and Turán-type results for planar intersection graphs (2008) — 69 citations
• A semi-algebraic version of Zarankiewicz's problem (2014) — 141 citations
• Thirty essays on geometric graph theory (2013) — 68 citations
• Wiley‐Interscience Series in Discrete Mathematics and Optimization (2011) — 153 citations
• Extremal Graph Theory (2011) — 543 citations
• Erdős–Szekeres‐type theorems for monotone paths and convex bodies (2011) — 79 citations
• Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects (2008) — 56 citations
• State of the Union (of geometric objects) (2008) — 50 citations
• Research problems in discrete geometry (2005) — 933 citations
• Towards a Theory of Geometric Graphs (2004) — 249 citations
• Monotone drawings of planar graphs (2004) — 87 citations
• Conflict-free colorings (2003) — 66 citations
• A Ramsey-type theorem for bipartite graphs (2000) — 56 citations
• Thirteen problems on crossing numbers (2000) — 80 citations