The following pages link to János Pach (Q188717):
Displaying 50 items.
- Lenses in arrangements of pseudo-circles and their applications (Q5501188) (← links)
- (Q5689019) (← links)
- (Q5692720) (← links)
- Graph Drawing (Q5711621) (← links)
- (Q5717951) (← links)
- Large Homogeneous Submatrices (Q5855527) (← links)
- (Q5881918) (← links)
- Disjointness graphs of segments in the space (Q5886095) (← links)
- Drawing planar graphs of bounded degree with few slopes (Q5891179) (← links)
- String graphs and incomparability graphs (Q5891424) (← links)
- String graphs and incomparability graphs (Q5891657) (← links)
- Indecomposable Coverings (Q5895103) (← links)
- Intersecting convex sets by rays (Q5896956) (← links)
- Discrete and Computational Geometry (Q5897106) (← links)
- Graph Drawing (Q5897642) (← links)
- Reconfigurations in Graphs and Grids (Q5900354) (← links)
- Indecomposable Coverings (Q5901346) (← links)
- Intersecting convex sets by rays (Q5901418) (← links)
- Reconfigurations in Graphs and Grids (Q5901488) (← links)
- Guest editors' foreword (Q5917634) (← links)
- The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\) (Q5937134) (← links)
- On the number of balanced lines (Q5939472) (← links)
- Common tangents to four unit balls in \(\mathbb{R}^3\) (Q5939537) (← links)
- Radial points in the plane (Q5946643) (← links)
- Covering lattice points by subspaces (Q5948353) (← links)
- Separating convex sets by straight lines (Q5951952) (← links)
- Crossing patterns of segments (Q5953378) (← links)
- Ramsey-type theorems with forbidden subgraphs (Q5955193) (← links)
- Embedding planar graphs at fixed vertex locations (Q5956107) (← links)
- Sunflowers in set systems of bounded dimension (Q6057492) (← links)
- Bounded VC-Dimension Implies the Schur-Erdős Conjecture (Q6059997) (← links)
- Optimal Embedded and Enclosing Isosceles Triangles (Q6066459) (← links)
- Successive vertex orderings of fully regular graphs (Q6111262) (← links)
- Disjointness graphs of short polygonal chains (Q6144392) (← links)
- Semi-algebraic colorings of complete graphs (Q6262161) (← links)
- The number of crossings in multigraphs with no empty lens (Q6306050) (← links)
- Coloring Hasse diagrams and disjointness graphs of curves (Q6324024) (← links)
- Crossings between non-homotopic edges (Q6343804) (← links)
- On the number of edges of separated multigraphs (Q6375998) (← links)
- Extremal problems for geometric hypergraphs (Q6487430) (← links)
- Odd-Sunflowers (Q6513876) (← links)
- Two trees are better than one (Q6515039) (← links)
- Disjointness graphs of short polygonal chains (Q6539561) (← links)
- Odd-sunflowers (Q6543050) (← links)
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem (Q6563995) (← links)
- Eli Goodman (1933--2021) and Ricky Pollack (1935--2018) (Q6610733) (← links)
- Ordered graphs and large bi-cliques in intersection graphs of curves (Q6621252) (← links)
- Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs (Q6730291) (← links)
- Enumeration of intersection graphs of $x$-monotone curves (Q6730866) (← links)
- Ruzsa's problem on Bi-Sidon sets (Q6743118) (← links)
