The following pages link to János Pach (Q188717):
Displayed 50 items.
- On the Zarankiewicz problem for intersection hypergraphs (Q272311) (← links)
- Unsplittable coverings in the plane (Q317324) (← links)
- Monochromatic empty triangles in two-colored point sets (Q385155) (← links)
- The visible perimeter of an arrangement of disks (Q390363) (← links)
- The range of a random walk on a comb (Q396906) (← links)
- A note on coloring line arrangements (Q405217) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Drawing Hamiltonian cycles with no large angles (Q426910) (← links)
- Lower bounds on the obstacle number of graphs (Q426912) (← links)
- Tangencies between families of disjoint regions in the plane (Q427060) (← links)
- Piercing quasi-rectangles-on a problem of Danzer and Rogers (Q439049) (← links)
- Opaque sets (Q517796) (← links)
- Disjoint edges in topological graphs (Q547867) (← links)
- A computational approach to Conway's thrackle conjecture (Q551503) (← links)
- Turán-type results for partial orders and intersection graphs of convex sets (Q607823) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- On the structure of graphs with low obstacle number (Q659699) (← links)
- Ramsey-Turán numbers for semi-algebraic graphs (Q668033) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- The grid revisited (Q686463) (← links)
- More distinct distances under local conditions (Q722329) (← links)
- Tilings of the plane with unit area triangles of bounded diameter (Q722368) (← links)
- Separation with restricted families of sets (Q739393) (← links)
- Double-normal pairs in the plane and on the sphere (Q747563) (← links)
- Delicate symmetry (Q750905) (← links)
- Variations on the theme of repeated distances (Q756139) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- On disjointly representable sets (Q790112) (← links)
- How to build a barricade (Q795340) (← links)
- Matching binary convexities (Q796106) (← links)
- How to draw a planar graph on a grid (Q804582) (← links)
- How to make a graph bipartite (Q805628) (← links)
- Distinct distances determined by subsets of a point set in space (Q808426) (← links)
- The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis (Q810525) (← links)
- Directions in combinatorial geometry (Q814167) (← links)
- On the diameter of separated point sets with many nearly equal distances (Q850083) (← links)
- Improving the crossing lemma by finding more crossings in sparse graphs (Q854708) (← links)
- How many ways can one draw a graph? (Q879163) (← links)
- Remarks on Schur's conjecture (Q899710) (← links)
- Long alternating paths in bicolored point sets (Q941368) (← links)
- Separator theorems and Turán-type results for planar intersection graphs (Q947779) (← links)
- Decomposition of multiple coverings into many parts (Q955226) (← links)
- A bipartite strengthening of the crossing Lemma (Q968451) (← links)
- Coloring axis-parallel rectangles (Q986114) (← links)
- Convexly independent subsets of the Minkowski sum of planar point sets (Q1010661) (← links)
- Degenerate crossing numbers (Q1014334) (← links)
- On regular vertices of the union of planar convex objects (Q1017923) (← links)
- A bipartite analogue of Dilworth's theorem for multiple partial orders (Q1041604) (← links)
- Points surrounding the origin (Q1046738) (← links)
- A point set everywhere dense in the plane (Q1063245) (← links)