The following pages link to Meir Katchalski (Q398517):
Displayed 50 items.
- (Q221585) (redirect page) (← links)
- Fat triangulations, curvature and quasiconformal mappings (Q398518) (← links)
- Nondegenerate families of convex cones and convex polytopes (Q754482) (← links)
- Cutting rectangles in the plane (Q1051268) (← links)
- Separating pairs of points of standard boxes (Q1075327) (← links)
- Snakes and pseudo-snakes in powers of complete graphs (Q1096640) (← links)
- On empty triangles determined by points in the plane (Q1109343) (← links)
- On the snake in the box problem (Q1113920) (← links)
- Thin sets and common transversals (Q1140866) (← links)
- On a set of lattice points not containing the vertices of a square (Q1170194) (← links)
- Further results on snakes in powers of complete graphs (Q1182573) (← links)
- The dimension of intersections of convex sets. II (Q1232696) (← links)
- Intersecting all edges of convex polytopes by planes (Q1244519) (← links)
- A Turan type problem for interval graphs (Q1251233) (← links)
- Reconstructing dimensions of intersections of convex sets (Q1258518) (← links)
- A Helly type conjecture (Q1283738) (← links)
- An extremal problem for families of pairs of subspaces (Q1329075) (← links)
- Proof of a conjecture of Dirac concerning 4-critical planar graphs (Q1336675) (← links)
- On geometric graphs with no two edges in convex position (Q1387850) (← links)
- A constant bound for geometric permutations of disjoint unit balls (Q1404497) (← links)
- A Helly-type theorem for line transversals to disjoint unit balls (Q1404524) (← links)
- Covering squares with squares (Q1580737) (← links)
- Not all graphs are segment \(T\)-graphs (Q1813624) (← links)
- Ordered colourings (Q1896351) (← links)
- Forcing disjoint segments in the plane (Q1916059) (← links)
- Geometric permutations for convex sets (Q2266447) (← links)
- Forbidden families of geometric permutations in \(\mathbb R^{d}\) (Q2486854) (← links)
- The maximal number of geometric permutations for \(n\) disjoint translates of a convex set in \(\mathbb R\) is \(\Omega(n)\) (Q2492643) (← links)
- Cutting disjoint disks by straight lines (Q2640143) (← links)
- The maximum size of a convex polygon in a restricted set of points in the plane (Q2640144) (← links)
- Helly's Theorem with Volumes (Q3336285) (← links)
- The existence of thick triangulations -- an "elementary" proof (Q3397715) (← links)
- On <i>k</i>-Cycled Refinements of Certain Graphs (Q3671201) (← links)
- Cutting Families of Convex Sets (Q3874878) (← links)
- Boxes in R<sup><i>n</i></sup> —A ‘Fractional’ Theorem (Q3920247) (← links)
- Separating plane convex sets. (Q3983404) (← links)
- (Q3991258) (← links)
- Some Properties of Families of Convex Cones (Q4137719) (← links)
- A Helly type Theorem for Convex Sets (Q4150784) (← links)
- A Helly Type Theorem on the Sphere (Q4163994) (← links)
- (Q4198511) (← links)
- (Q4282944) (← links)
- Touching Convex Sets in the Plane (Q4322138) (← links)
- (Q4326188) (← links)
- On a conjecture of Danzer and Grünbaum (Q4717095) (← links)
- A conjecture of Grünbaum on common transversals. (Q4727759) (← links)
- Quantitative Helly-Type Theorems (Q4748728) (← links)
- On Short Edges in Straight-Edge Triangulations. (Q4884365) (← links)
- (Q5692696) (← links)
- The dimension of intersections of convex sets (Q5921425) (← links)