János Pach

From MaRDI portal
Person:188717

Available identifiers

zbMath Open pach.janosDBLP18/2119WikidataQ10561955 ScholiaQ10561955MaRDI QIDQ188717

List of research outcomes





PublicationDate of PublicationType
Ordered graphs and large bi-cliques in intersection graphs of curves2024-10-18Paper
Eli Goodman (1933--2021) and Ricky Pollack (1935--2018)2024-09-26Paper
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem2024-06-28Paper
Odd-sunflowers2024-05-24Paper
Disjointness graphs of short polygonal chains2024-05-14Paper
Small triangular containers for triangles -- on a problem of Nandakumar2024-05-08Paper
Where Have All the Grasshoppers Gone?2024-03-27Paper
Disjointness graphs of short polygonal chains2024-01-29Paper
A structure theorem for pseudo-segments and its applications2023-12-01Paper
Optimal Embedded and Enclosing Isosceles Triangles2023-11-16Paper
Bounded VC-Dimension Implies the Schur-Erdős Conjecture2023-11-02Paper
Maximum Betti numbers of \v{C}ech complexes2023-10-23Paper
Sunflowers in set systems of bounded dimension2023-10-04Paper
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem2023-08-16Paper
Successive vertex orderings of fully regular graphs2023-07-06Paper
Decomposition of Geometric Graphs into Star Forests2023-06-22Paper
Disjointness graphs of segments in the space2023-03-30Paper
https://portal.mardi4nfdi.de/entity/Q58819182023-03-13Paper
Extremal problems for geometric hypergraphs2023-01-25Paper
Exchange Properties of Finite Set-Systems2022-08-31Paper
https://portal.mardi4nfdi.de/entity/Q50889662022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50889862022-07-18Paper
On the number of edges of separated multigraphs2022-07-01Paper
Crossings between non-homotopic edges2022-06-10Paper
https://portal.mardi4nfdi.de/entity/Q50776522022-05-18Paper
On well-connected sets of strings2022-04-04Paper
Bounded \(VC\)-dimension implies the Schur-Erdős conjecture2022-01-06Paper
Random necklaces require fewer cuts2021-12-29Paper
Crossings Between Non-homotopic Edges2021-12-01Paper
Erdős-Hajnal-type results for monotone paths2021-09-16Paper
On the number of edges of separated multigraphs2021-08-25Paper
Planar point sets determine many pairwise crossing segments2021-07-05Paper
Large Homogeneous Submatrices2021-03-18Paper
Shattered matchings in intersecting hypergraphs2021-02-23Paper
Colorings with only rainbow arithmetic progressions2021-01-25Paper
Two extensions of the Erdős-Szekeres problem2020-12-17Paper
Coloring Hasse diagrams and disjointness graphs of curves2020-10-26Paper
A farewell to Ricky Pollack2020-10-23Paper
The Schur-Erdős problem for semi-algebraic colorings2020-10-15Paper
A crossing lemma for multigraphs2020-08-18Paper
On the chromatic number of disjointness graphs of curves2020-07-07Paper
Crossings between non-homotopic edges2020-06-26Paper
A crossing lemma for multigraphs2020-06-16Paper
Planar point sets determine many pairwise crossing segments2020-01-30Paper
Minimum area isosceles containers2020-01-26Paper
Approximating the rectilinear crossing number2019-10-25Paper
A lower bound on opaque sets2019-10-18Paper
Tiling the plane with equilateral triangles2019-09-19Paper
Ordered graphs and large bi-cliques in intersection graphs of curves2019-08-30Paper
Coloring Hasse diagrams and disjointness graphs of curves2019-08-22Paper
Many touchings force many crossings2019-07-17Paper
On the size of $K$-cross-free families2019-05-23Paper
Erdős-Hajnal conjecture for graphs with bounded VC-dimension2019-05-21Paper
Sphere-of-influence graphs in normed spaces2019-04-30Paper
Thrackles: an improved upper bound2019-03-28Paper
Ramsey-Turán numbers for semi-algebraic graphs2019-03-05Paper
A stability theorem on cube tessellations2019-02-27Paper
Many Touchings Force Many Crossings2019-02-20Paper
Thrackles: An Improved Upper Bound2019-02-20Paper
https://portal.mardi4nfdi.de/entity/Q46230332019-02-18Paper
Two nearly equal distances in $R^d$2019-01-04Paper
Lenses in arrangements of pseudo-circles and their applications2018-11-23Paper
CONTROLLING LIPSCHITZ FUNCTIONS2018-11-20Paper
Borsuk and Ramsey Type Questions in Euclidean Space2018-10-09Paper
The number of crossings in multigraphs with no empty lens2018-08-30Paper
Tilings with noncongruent triangles2018-08-24Paper
Disjointness graphs of segments2018-08-13Paper
Erdos-Hajnal conjecture for graphs with bounded VC-dimension2018-08-13Paper
More distinct distances under local conditions2018-07-23Paper
Tilings of the plane with unit area triangles of bounded diameter2018-07-23Paper
Beyond the Richter-Thomassen Conjecture2018-07-16Paper
From Tarski's Plank Problem to Simultaneous Approximation2018-07-13Paper
Decomposition of a Cube into Nearly Equal Smaller Cubes2018-07-13Paper
A crossing lemma for Jordan curves2018-06-26Paper
Weight Balancing on Boundaries and Skeletons2018-04-23Paper
Distinct distances on algebraic curves in the plane2018-04-23Paper
Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems2018-02-26Paper
Note on \(k\)-planar crossing numbers2018-02-19Paper
A Lower Bound on Opaque Sets2018-01-30Paper
New Lower Bounds for ϵ-nets2018-01-30Paper
ARRANGEMENTS OF HOMOTHETS OF A CONVEX BODY2017-12-01Paper
https://portal.mardi4nfdi.de/entity/Q45890142017-11-06Paper
Forbidden patterns and unit distances2017-10-20Paper
On grids in topological graphs2017-10-20Paper
Distinct Distances on Algebraic Curves in the Plane2017-10-10Paper
On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves2017-10-10Paper
Density and regularity theorems for semi-algebraic hypergraphs2017-10-05Paper
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves2017-10-05Paper
Decomposition of Multiple Packings with Subquadratic Union Complexity2017-10-04Paper
https://portal.mardi4nfdi.de/entity/Q53651062017-09-29Paper
A tight bound for the number of different directions in three dimensions2017-09-29Paper
The union of congruent cubes in three dimensions2017-09-29Paper
Pushing squares around2017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53651092017-09-29Paper
Solution of Scott's problem on the number of directions determined by a point set in 3-space2017-09-29Paper
Improving the crossing lemma by finding more crossings in sparse graphs2017-09-29Paper
Cutting glass2017-09-29Paper
A semi-algebraic version of Zarankiewicz's problem2017-06-01Paper
Opaque sets2017-03-27Paper
The number of distinct distances from a vertex of a convex polygon2017-03-09Paper
Approximating the Rectilinear Crossing Number2017-02-21Paper
On the Zarankiewicz Problem for Intersection Hypergraphs2017-02-10Paper
Simultaneous Approximation of Polynomials2017-02-01Paper
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing2017-01-16Paper
https://portal.mardi4nfdi.de/entity/Q31790612016-12-20Paper
Unsplittable coverings in the plane2016-10-21Paper
Unsplittable coverings in the plane2016-09-30Paper
Separation with restricted families of sets2016-08-18Paper
On the Zarankiewicz problem for intersection hypergraphs2016-04-20Paper
Remarks on Schur's conjecture2015-12-30Paper
Double-normal pairs in the plane and on the sphere2015-10-16Paper
A Precise Threshold for Quasi-Ramsey Numbers2015-09-23Paper
Cross-Intersecting Families of Vectors2015-09-14Paper
Every graph admits an unambiguous bold drawing2015-08-25Paper
Lenses in arrangements of pseudo-circles and their applications2015-08-01Paper
Survey on Decomposition of Multiple Coverings2015-06-24Paper
Semi-algebraic colorings of complete graphs2015-05-27Paper
Cross-intersecting families of vectors2015-05-22Paper
Saturated simple and \(k\)-simple topological graphs2015-05-12Paper
DOUBLE‐NORMAL PAIRS IN SPACE2015-03-19Paper
The Erdős-Hajnal conjecture for rainbow triangles2015-03-05Paper
Ramsey-type results for semi-algebraic relations2015-02-17Paper
Online conflict-free coloring for intervals2014-10-13Paper
Ramsey-type results for semi-algebraic relations2014-09-19Paper
A note on coloring line arrangements2014-09-04Paper
The range of a random walk on a comb2014-08-14Paper
String graphs and incomparability graphs2014-08-07Paper
On grids in topological graphs2014-06-27Paper
https://portal.mardi4nfdi.de/entity/Q54199652014-06-11Paper
On the Upward Planarity of Mixed Plane Graphs2014-05-22Paper
The Beginnings of Geometric Graph Theory2014-05-19Paper
Applications of a New Separator Theorem for String Graphs2014-05-02Paper
On the Queue Number of Planar Graphs2014-04-11Paper
Tangencies between families of disjoint regions in the plane2014-04-03Paper
Tight lower bounds for the size of epsilon-nets2014-03-24Paper
Homogeneous selections from hyperplanes2014-02-06Paper
The visible perimeter of an arrangement of disks2014-01-08Paper
On the Upward Planarity of Mixed Plane Graphs2013-12-20Paper
Remarks on Schur’s Conjecture2013-12-06Paper
Monochromatic empty triangles in two-colored point sets2013-11-29Paper
Drawing planar graphs of bounded degree with few slopes2013-09-26Paper
Remarks on a Ramsey theory for trees2013-08-06Paper
Two and a half billion years of distance research2013-07-10Paper
The Number of Edges in $k$-Quasi-planar Graphs2013-06-27Paper
Tight lower bounds for the size of epsilon-nets2013-05-30Paper
Monotone crossing number2013-04-15Paper
The Visible Perimeter of an Arrangement of Disks2013-04-03Paper
How Many Potatoes Are in a Mesh?2013-03-21Paper
Large simplices determined by finite point sets2013-03-19Paper
https://portal.mardi4nfdi.de/entity/Q49069402013-02-28Paper
Tangled Thrackles2013-01-07Paper
Erdős-Szekeres-type theorems for monotone paths and convex bodies2012-11-30Paper
Overlap properties of geometric expanders2012-10-31Paper
Piercing quasi-rectangles-on a problem of Danzer and Rogers2012-08-01Paper
String graphs and incomparability graphs2012-07-20Paper
Tangencies between families of disjoint regions in the plane2012-06-13Paper
Drawing Hamiltonian cycles with no large angles2012-06-12Paper
Lower bounds on the obstacle number of graphs2012-06-12Paper
Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane2012-05-04Paper
Every Graph Admits an Unambiguous Bold Drawing2012-03-09Paper
Monotone Crossing Number2012-03-09Paper
Disjoint homometric sets in graphs2012-03-07Paper
Minimum clique partition in unit disk graphs2012-01-24Paper
On the structure of graphs with low obstacle number2012-01-24Paper
Opaque Sets2011-08-17Paper
A computational approach to Conway's thrackle conjecture2011-07-20Paper
Conway’s Conjecture for Monotone Thrackles2011-06-30Paper
Disjoint edges in topological graphs2011-06-27Paper
Intersection patterns of curves2011-04-08Paper
https://portal.mardi4nfdi.de/entity/Q30782052011-02-18Paper
Drawing planar graphs of bounded degree with few slopes2011-02-11Paper
A Computational Approach to Conway’s Thrackle Conjecture2011-02-11Paper
Small (2,s)-colorable graphs without 1-obstacle representations2010-12-29Paper
Turán-type results for partial orders and intersection graphs of convex sets2010-12-06Paper
A Separator Theorem for String Graphs and its Applications2010-11-19Paper
Graphs with Large Obstacle Numbers2010-11-16Paper
Crossing numbers of imbalanced graphs2010-11-10Paper
Distinct distances in three and higher dimensions2010-08-16Paper
Coloring axis-parallel rectangles2010-08-11Paper
https://portal.mardi4nfdi.de/entity/Q35794652010-08-06Paper
How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position?2010-06-01Paper
A bipartite strengthening of the crossing Lemma2010-05-05Paper
Drawing Hamiltonian Cycles with No Large Angles2010-04-27Paper
Conflict-Free Colourings of Graphs and Hypergraphs2010-04-22Paper
Crossings between Curves with Many Tangencies2010-02-09Paper
Discrete and Computational Geometry2010-02-05Paper
Cubic graphs have bounded slope parameter2010-02-04Paper
https://portal.mardi4nfdi.de/entity/Q36567242010-01-13Paper
Points surrounding the origin2009-12-28Paper
A bipartite analogue of Dilworth's theorem for multiple partial orders2009-12-03Paper
Indecomposable Coverings2009-10-15Paper
Intersecting convex sets by rays2009-08-27Paper
Graph Drawing2009-08-11Paper
On regular vertices of the union of planar convex objects2009-05-13Paper
Degenerate crossing numbers2009-04-27Paper
Convexly independent subsets of the Minkowski sum of planar point sets2009-04-07Paper
Reconfigurations in Graphs and Grids2009-03-16Paper
Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles2009-03-04Paper
Cubic Graphs Have Bounded Slope Parameter2009-03-03Paper
SLIDING DISKS IN THE PLANE2009-03-02Paper
A Separator Theorem for String Graphs and Its Applications2009-02-24Paper
On planar intersection graphs with forbidden subgraphs2009-02-20Paper
Intersecting convex sets by rays2009-02-12Paper
Towards an implementation of the 3D visibility skeleton2009-02-12Paper
Coloring k k -free intersection graphs of geometric objects in the plane2009-02-12Paper
On regular vertices on the union of planar objects2009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36015462009-02-10Paper
Coloring Axis-Parallel Rectangles2009-01-13Paper
https://portal.mardi4nfdi.de/entity/Q53026102009-01-08Paper
Decomposition of multiple coverings into many parts2008-11-19Paper
Separator theorems and Turán-type results for planar intersection graphs2008-10-07Paper
Reconfigurations in Graphs and Grids2008-09-18Paper
Long alternating paths in bicolored point sets2008-09-04Paper
State of the union (of geometric objects)2008-07-21Paper
Erdős-Hajnal-type results on intersection patterns of geometric objects2008-07-01Paper
Drawing cubic graphs with at most five slopes2008-04-28Paper
A Bipartite Strengthening of the Crossing Lemma2008-03-25Paper
Sliding Disks in the Plane2008-03-18Paper
Forbidden paths and cycles in ordered graphs and matrices2008-02-22Paper
Solution of Scott's problem on the number of directions determined by a point set in 3-space2007-12-19Paper
Online Conflict‐Free Coloring for Intervals2007-10-22Paper
Drawing Cubic Graphs with at Most Five Slopes2007-08-28Paper
Indecomposable Coverings2007-08-28Paper
Opposite-quadrant depth in the plane2007-07-19Paper
How many ways can one draw a graph?2007-05-08Paper
https://portal.mardi4nfdi.de/entity/Q34248982007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q54902762007-01-26Paper
Improving the crossing lemma by finding more crossings in sparse graphs2006-12-06Paper
On the diameter of separated point sets with many nearly equal distances2006-11-15Paper
Graph Drawing2006-11-13Paper
PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE2006-10-16Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54746272006-06-26Paper
Pushing squares around2006-06-16Paper
Nearly equal distances and Szemerédi's regularity lemma2006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q52902752006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q33742532006-03-09Paper
Directions in combinatorial geometry2006-02-06Paper
Bounded-degree graphs can have arbitrarily large slope numbers2006-01-17Paper
https://portal.mardi4nfdi.de/entity/Q57179512006-01-13Paper
Graph Drawing2005-12-07Paper
Topological graphs with no large grids2005-11-24Paper
Crossing patterns of semi-algebraic sets2005-09-28Paper
https://portal.mardi4nfdi.de/entity/Q56927202005-09-28Paper
Covering lattice points by subspaces2005-06-22Paper
https://portal.mardi4nfdi.de/entity/Q46575902005-03-14Paper
https://portal.mardi4nfdi.de/entity/Q46575892005-03-14Paper
Research Problems in Discrete Geometry2005-01-11Paper
On the number of directions determined by a three-dimensional points set2004-10-14Paper
Geometric graphs with no self-intersecting path of length three2004-10-04Paper
PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS2004-09-29Paper
Distinct Distances in Three and Higher Dimensions2004-09-24Paper
Towards an implementation of the 3D visibility skeleton2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q30437222004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q30437132004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44723222004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44647312004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44551122004-03-16Paper
Unavoidable configurations in complete topological graphs2004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44278852003-09-14Paper
https://portal.mardi4nfdi.de/entity/Q44222892003-09-03Paper
The union of congruent cubes in three dimensions2003-08-21Paper
Isosceles triangles determined by a planar point set2003-03-27Paper
Untangling a polygon2003-03-17Paper
Recognizing string graphs is decidable2003-03-17Paper
A modular version of the Erdős– Szekeres theorem2003-02-18Paper
Which crossing number is it anyway?2002-12-10Paper
https://portal.mardi4nfdi.de/entity/Q47785612002-11-18Paper
Separating convex sets by straight lines2002-11-11Paper
On the Boundary Complexity of the Union of Fat Triangles2002-09-29Paper
Embedding planar graphs at fixed vertex locations2002-08-28Paper
https://portal.mardi4nfdi.de/entity/Q45478182002-08-21Paper
Radial points in the plane2002-08-21Paper
https://portal.mardi4nfdi.de/entity/Q45478192002-08-21Paper
On the number of balanced lines2002-07-10Paper
Cellular telephone networks and random maps in hypergraphs2002-04-21Paper
Crossing patterns of segments2002-03-11Paper
Ramsey-type theorems with forbidden subgraphs2002-02-13Paper
https://portal.mardi4nfdi.de/entity/Q45250532002-01-28Paper
https://portal.mardi4nfdi.de/entity/Q44100192002-01-01Paper
The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\)2001-10-30Paper
Common tangents to four unit balls in \(\mathbb{R}^3\)2001-09-03Paper
https://portal.mardi4nfdi.de/entity/Q45039472001-07-03Paper
New bounds on crossing numbers2001-06-28Paper
Erdős-Szekeres-type theorems for segments and noncrossing convex sets2001-04-23Paper
https://portal.mardi4nfdi.de/entity/Q45040302001-04-20Paper
https://portal.mardi4nfdi.de/entity/Q44846912001-03-15Paper
Bichromatic lines with few points2001-03-04Paper
Cutting glass2000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q42636612000-02-16Paper
Popular distances in 3-space1999-12-20Paper
Uniformly distributed distances -- a geometric application of Janson's inequality1999-12-08Paper
On the boundary of the union of planar convex sets1999-12-06Paper
https://portal.mardi4nfdi.de/entity/Q44009911999-06-14Paper
Ramsey-type results for geometric graphs. II1999-05-16Paper
https://portal.mardi4nfdi.de/entity/Q42253071999-04-22Paper
https://portal.mardi4nfdi.de/entity/Q42253081999-01-18Paper
Canonical theorems for convex sets1999-01-04Paper
A generalisation of the Erdős-Szekeres theorem to disjoint convex sets1998-12-15Paper
Graphs drawn with few crossings per edge1998-11-24Paper
On the Number of Incidences Between Points and Curves1998-11-22Paper
On circumscribing polygons for line segments1998-10-01Paper
Guest editor's foreword (Special issue dedicated to the memory of Paul Erdős)1998-09-08Paper
A Tverberg-type result on multicolored simplices1998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43478941998-06-08Paper
Ramsey-type results for geometric graphs. I1998-04-22Paper
On Conway's thrackle conjecture1998-03-11Paper
On a metric generalization of Ramsey's theorem1998-03-08Paper
https://portal.mardi4nfdi.de/entity/Q43523311998-03-02Paper
Quasi-planar graphs have a linear number of edges1998-01-05Paper
Two places at once: A remembrance of Paul Erdős1997-12-15Paper
https://portal.mardi4nfdi.de/entity/Q43654991997-11-04Paper
https://portal.mardi4nfdi.de/entity/Q43390951997-06-04Paper
https://portal.mardi4nfdi.de/entity/Q31276361997-04-10Paper
https://portal.mardi4nfdi.de/entity/Q56890191997-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48731841996-11-24Paper
Applications of the crossing number1996-08-12Paper
https://portal.mardi4nfdi.de/entity/Q48851861996-07-15Paper
https://portal.mardi4nfdi.de/entity/Q42913681996-06-23Paper
Rich cells in an arrangement of hyperplanes1996-02-12Paper
Touching Convex Sets in the Plane1995-11-12Paper
Common tangents and common transversals1995-11-12Paper
https://portal.mardi4nfdi.de/entity/Q43281851995-09-19Paper
https://portal.mardi4nfdi.de/entity/Q43266401995-07-13Paper
Guest editors' foreword1995-07-05Paper
A left-first search algorithm for planar graphs1995-07-02Paper
https://portal.mardi4nfdi.de/entity/Q43281831995-03-30Paper
A Ramsey-Type Result for Convex Sets1994-12-14Paper
On the Number of Convex Lattice Polygons1994-11-01Paper
https://portal.mardi4nfdi.de/entity/Q31387541994-09-26Paper
The complexity of a class of infinite graphs1994-09-04Paper
The grid revisited1994-08-22Paper
Crossing families1994-08-11Paper
Some geometric applications of Dilworth's theorem1994-08-10Paper
Nearly Equal Distances in the Plane1994-04-28Paper
Fat Triangles Determine Linearly Many Holes1994-04-27Paper
An invariant property of balls in arrangements of hyperplanes1994-01-19Paper
https://portal.mardi4nfdi.de/entity/Q31382921993-12-15Paper
How hard is half-space range searching?1993-09-30Paper
Weaving patterns of lines and line segments in space1993-06-29Paper
A Turán-type theorem on chords of a convex polygon1993-03-10Paper
Universal elements and the complexity of certain classes of infinite graphs1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40113231992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40113101992-09-27Paper
Almost tight bounds for \(\epsilon\)-nets1992-06-28Paper
Repeated angles in the plane and related problems1992-06-28Paper
Arrangements of curves in the plane --- topology, combinatorics, and algorithms1992-06-28Paper
An upper bound on the number of planar \(K\)-sets1992-06-28Paper
On the average volume of subsets in Euclidean \(d\)-space1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39749701992-06-26Paper
On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm1992-06-25Paper
A Problem of Leo Moser About Repeated Distances on the Sphere1992-06-25Paper
On the maximal number of certain subgraphs in \(K_ r\)-free graphs1992-06-25Paper
Distinct distances determined by subsets of a point set in space1991-01-01Paper
How to draw a planar graph on a grid1990-01-01Paper
Variations on the theme of repeated distances1990-01-01Paper
Note on vertex-partitions of infinite graphs1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746741990-01-01Paper
Radius, diameter, and minimum degree1989-01-01Paper
Explicit codes with low covering radius1989-01-01Paper
Delicate symmetry1989-01-01Paper
On arrangements of Jordan arcs with three intersections per pair1989-01-01Paper
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis1989-01-01Paper
Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38326061988-01-01Paper
How to make a graph bipartite1988-01-01Paper
Cutting a graph into two dissimilar halves1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37952191988-01-01Paper
Cell decomposition of polytopes by bending1988-01-01Paper
Repeated distances in space1988-01-01Paper
Some universal graphs1988-01-01Paper
An upper bound for families of linearly related plane convex sets1988-01-01Paper
An extremal problem onKr-free graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34817411988-01-01Paper
Bounding one-way differences1987-01-01Paper
Covering the plane with convex polygons1986-01-01Paper
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles1986-01-01Paper
Maximal volume enclosed by plates and proof of the chessboard conjecture1986-01-01Paper
A point set everywhere dense in the plane1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37141041985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36923951985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37141071985-01-01Paper
Helly's Theorem with Volumes1984-01-01Paper
On disjointly representable sets1984-01-01Paper
Discrete Convex Functions and Proof of the Six Circle Conjecture of Fejes Tóth1984-01-01Paper
How to build a barricade1984-01-01Paper
Universal graphs without large bipartite subgraphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808561984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47252501984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33187931984-01-01Paper
Partly Convex Peano Curves1983-01-01Paper
On a Quasi‐Ramsey problem1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36761561983-01-01Paper
On the number of sets in a null t-design1983-01-01Paper
Quantitative Helly-Type Theorems1982-01-01Paper
Graphs whose every independent set has a common neighbour1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39314281981-01-01Paper
A problem of Ulam on planar graphs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39266091981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47406901981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38864311980-01-01Paper
On a problem of L. Fejes Toth1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39128311980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39277921978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41733971977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38742391977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39060561977-01-01Paper
Two trees are better than oneN/APaper
Odd-SunflowersN/APaper

Research outcomes over time

This page was built for person: János Pach