The following pages link to János Pach (Q188717):
Displayed 50 items.
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles (Q1076976) (← links)
- Covering the plane with convex polygons (Q1077728) (← links)
- Maximal volume enclosed by plates and proof of the chessboard conjecture (Q1087146) (← links)
- An upper bound for families of linearly related plane convex sets (Q1097521) (← links)
- Repeated distances in space (Q1109785) (← links)
- Bounding one-way differences (Q1114687) (← links)
- Some universal graphs (Q1119949) (← links)
- Cell decomposition of polytopes by bending (Q1120831) (← links)
- Uniformly distributed distances -- a geometric application of Janson's inequality (Q1125611) (← links)
- On a problem of L. Fejes Toth (Q1144797) (← links)
- A problem of Ulam on planar graphs (Q1156811) (← links)
- Graphs whose every independent set has a common neighbour (Q1158445) (← links)
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs (Q1175549) (← links)
- On the average volume of subsets in Euclidean \(d\)-space (Q1178025) (← links)
- An upper bound on the number of planar \(K\)-sets (Q1184155) (← links)
- Almost tight bounds for \(\epsilon\)-nets (Q1184160) (← links)
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← links)
- Repeated angles in the plane and related problems (Q1185877) (← links)
- Universal elements and the complexity of certain classes of infinite graphs (Q1191925) (← links)
- A Turán-type theorem on chords of a convex polygon (Q1204472) (← links)
- Radius, diameter, and minimum degree (Q1262322) (← links)
- On arrangements of Jordan arcs with three intersections per pair (Q1262864) (← links)
- Graphs drawn with few crossings per edge (Q1272189) (← links)
- Ramsey-type results for geometric graphs. II (Q1272962) (← links)
- On the boundary of the union of planar convex sets (Q1289237) (← links)
- Popular distances in 3-space (Q1301635) (← links)
- An invariant property of balls in arrangements of hyperplanes (Q1312192) (← links)
- The complexity of a class of infinite graphs (Q1323483) (← links)
- Crossing families (Q1330788) (← links)
- Some geometric applications of Dilworth's theorem (Q1330876) (← links)
- Common tangents and common transversals (Q1333230) (← links)
- Two places at once: A remembrance of Paul Erdős (Q1361173) (← links)
- Quasi-planar graphs have a linear number of edges (Q1375051) (← links)
- On a metric generalization of Ramsey's theorem (Q1376051) (← links)
- (Q1380796) (redirect page) (← links)
- On Conway's thrackle conjecture (Q1380797) (← links)
- Ramsey-type results for geometric graphs. I (Q1380815) (← links)
- Guest editor's foreword (Special issue dedicated to the memory of Paul Erdős) (Q1387839) (← links)
- Canonical theorems for convex sets (Q1387854) (← links)
- A generalisation of the Erdős-Szekeres theorem to disjoint convex sets (Q1387855) (← links)
- A Tverberg-type result on multicolored simplices (Q1388134) (← links)
- On circumscribing polygons for line segments (Q1388139) (← links)
- The union of congruent cubes in three dimensions (Q1404535) (← links)
- Unavoidable configurations in complete topological graphs (Q1423589) (← links)
- Bichromatic lines with few points (Q1570762) (← links)
- Cellular telephone networks and random maps in hypergraphs (Q1570826) (← links)
- Erdős-Szekeres-type theorems for segments and noncrossing convex sets (Q1580260) (← links)
- Cutting glass (Q1580771) (← links)
- New bounds on crossing numbers (Q1591053) (← links)
- A crossing lemma for Jordan curves (Q1647400) (← links)