What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Geometry
- Discrete mathematics
His scientific interests lie mostly in Combinatorics, Discrete mathematics, Planar graph, Graph and Discrete geometry.
His research in Combinatorics intersects with topics in Plane, Upper and lower bounds and Type.
The concepts of his Planar graph study are interwoven with issues in Complement graph and Planar straight-line graph.
His Planar straight-line graph research is multidisciplinary, relying on both Linkless embedding, Embedding and Book embedding.
His Graph research includes elements of Pairwise comparison and Lemma.
His Discrete geometry research is multidisciplinary, incorporating perspectives in Minkowski space, Computational geometry, Series and Pure mathematics.
His most cited work include:
- Research Problems in Discrete Geometry (644 citations)
- How to draw a planar graph on a grid (618 citations)
- How to draw a planar graph on a grid (618 citations)
What are the main themes of his work throughout his whole career to date?
János Pach focuses on Combinatorics, Discrete mathematics, Plane, Graph and Conjecture.
The Combinatorics study combines topics in areas such as Upper and lower bounds, Bounded function and Regular polygon.
His Bounded function study combines topics in areas such as Hyperplane and Finite set.
His work in Topological graph, Complement graph, 1-planar graph, Multiple edges and Disjoint sets is related to Discrete mathematics.
His Plane study deals with Point intersecting with Simple.
The various areas that János Pach examines in his Planar graph study include Planar straight-line graph and Book embedding.
He most often published in these fields:
- Combinatorics (103.25%)
- Discrete mathematics (44.44%)
- Plane (23.93%)
What were the highlights of his more recent work (between 2017-2021)?
- Combinatorics (103.25%)
- Conjecture (13.68%)
- Vertex (12.82%)
In recent papers he was focusing on the following fields of study:
His primary areas of study are Combinatorics, Conjecture, Vertex, Graph and Plane.
His Combinatorics research is multidisciplinary, relying on both Upper and lower bounds, Bounded function and Constant.
His Conjecture study also includes fields such as
- Simple which is related to area like Arithmetic progression and Arithmetic,
- Lemma which intersects with area such as Discrete geometry.
His Vertex research is multidisciplinary, incorporating elements of Multiple edges, Multigraph and Ordered graph.
He combines subjects such as Intersection, Point, Pairwise comparison and Perimeter with his study of Plane.
His studies deal with areas such as Discrete mathematics, Riemann surface, Boundary, Simply connected space and Ackermann function as well as Jordan curve theorem.
Between 2017 and 2021, his most popular works were:
- On Arrangements of Jordan Arcs With Three Intersections Per Pair (24 citations)
- On Arrangements of Jordan Arcs With Three Intersections Per Pair (24 citations)
- Note on k-planar crossing numbers (12 citations)
In his most recent research, the most cited papers focused on:
- Geometry
- Combinatorics
- Algebra
Combinatorics, Graph, Plane, Vertex and Bounded function are his primary areas of study.
His Combinatorics study incorporates themes from Upper and lower bounds, Perimeter and Constant.
Many of his research projects under Graph are closely connected to Difficult problem with Difficult problem, tying the diverse disciplines of science together.
His studies in Plane integrate themes in fields like Chromatic scale, Disjoint sets, Family of curves, Jordan curve theorem and Ackermann function.
His Vertex research integrates issues from Binary logarithm, Monotone polygon and Complete bipartite graph.
The study incorporates disciplines such as Discrete mathematics, Riemann surface, Boundary, Simply connected space and Function in addition to Bounded function.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
