The following pages link to János Pach (Q188717):
Displaying 50 items.
- Tilings with noncongruent triangles (Q1663799) (← links)
- Note on \(k\)-planar crossing numbers (Q1699274) (← links)
- Thrackles: an improved upper bound (Q1735700) (← links)
- Sphere-of-influence graphs in normed spaces (Q1740485) (← links)
- Note on vertex-partitions of infinite graphs (Q1825887) (← links)
- On the number of sets in a null t-design (Q1837690) (← links)
- Which crossing number is it anyway? (Q1850498) (← links)
- Untangling a polygon (Q1864117) (← links)
- Recognizing string graphs is decidable (Q1864118) (← links)
- Isosceles triangles determined by a planar point set (Q1865634) (← links)
- On the number of directions determined by a three-dimensional points set (Q1881677) (← links)
- Geometric graphs with no self-intersecting path of length three (Q1883291) (← links)
- A left-first search algorithm for planar graphs (Q1892422) (← links)
- Rich cells in an arrangement of hyperplanes (Q1899434) (← links)
- Applications of the crossing number (Q1920423) (← links)
- Large simplices determined by finite point sets (Q1943341) (← links)
- Monotone crossing number (Q1946757) (← links)
- Erdős-Hajnal-type results for monotone paths (Q1984509) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Bounded \(VC\)-dimension implies the Schur-Erdős conjecture (Q2064760) (← links)
- On well-connected sets of strings (Q2121802) (← links)
- On the number of edges of separated multigraphs (Q2151445) (← links)
- A crossing lemma for multigraphs (Q2189737) (← links)
- The Schur-Erdős problem for semi-algebraic colorings (Q2204399) (← links)
- Coloring Hasse diagrams and disjointness graphs of curves (Q2206854) (← links)
- A farewell to Ricky Pollack (Q2207587) (← links)
- Two extensions of the Erdős-Szekeres problem (Q2216751) (← links)
- Colorings with only rainbow arithmetic progressions (Q2220973) (← links)
- Shattered matchings in intersecting hypergraphs (Q2229336) (← links)
- On grids in topological graphs (Q2249043) (← links)
- The Erdős-Hajnal conjecture for rainbow triangles (Q2259857) (← links)
- Many touchings force many crossings (Q2312603) (← links)
- Ordered graphs and large bi-cliques in intersection graphs of curves (Q2323249) (← links)
- A lower bound on opaque sets (Q2330035) (← links)
- Approximating the rectilinear crossing number (Q2331210) (← links)
- Saturated simple and \(k\)-simple topological graphs (Q2344053) (← links)
- Cross-intersecting families of vectors (Q2345515) (← links)
- Weaving patterns of lines and line segments in space (Q2366236) (← links)
- Opposite-quadrant depth in the plane (Q2373438) (← links)
- Remarks on a Ramsey theory for trees (Q2392039) (← links)
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
- On the size of $K$-cross-free families (Q2416517) (← links)
- Homogeneous selections from hyperplanes (Q2434718) (← links)
- Solution of Scott's problem on the number of directions determined by a point set in 3-space (Q2464369) (← links)
- Forbidden paths and cycles in ordered graphs and matrices (Q2472738) (← links)
- Drawing cubic graphs with at most five slopes (Q2483558) (← links)
- Nearly equal distances and Szemerédi's regularity lemma (Q2489544) (← links)
- Pushing squares around (Q2494118) (← links)
- Crossing patterns of semi-algebraic sets (Q2566809) (← links)
- Topological graphs with no large grids (Q2573803) (← links)
