Meir Katchalski Publications

Publications

  • 1. M. Katchalski, The dimension of intersections of convex sets, Israel J. Math., 10 (1971), 465-470.
  • 2. M. Katchalski, The dimension of intersections of convex sets II, Israel J. Math., 26 (1977), 209-231.
  • 3. M. Katchalski, Intersecting all edges of convex polytopes by planes, Discrete Mathematics, 19 (1977), 273-279.
  • 4. M. Katchalski, Some properties of families of convex cones, Trans. A.M.S., 233 (1977), 235-240.
  • 5. M. Katchalski, A. Helly type theorem on the sphere, Proc. A.M.S., 66 (1977), 119-122.
  • 6. M. Katchalski, A. Helly type theorem for convex sets, Can. Math. Bull., 21 (1978), 121-123.
  • 7. M. Katchalski, Reconstructing dimensions of intersections of convex sets, Aequationes Mathematica, 17 (1978), 249-254.
  • 8. H.L. Abbott and M. Katchalski, Linear ordering satisfying certain constraints, Ars Combinatoria, 6 (1978), 19-26.
  • 9. H.L. Abbott and M. Katchalski, A Turan type problem for interval graphs, Discrete Math., 25 (1979), 85-88.
  • 10. M. Katchalski and A.C. Liu, Arcs on the circle and p-tuplets on the line, Discrete Math., 27 (1979), 55-69.
  • 11. M. Katchalski and A.C. Liu, A problem of geometry in R , Proc. A.M.S., 75 (1979), 284-288.
  • 12. M. Katchalski, Nondegenerate families of convex cones and convex polytopes, Geometriae Dedicata, 8 (1979), 417-421.
  • 13. M. Katchalski, Boxes in R – a ‘fractional’ theorem, Can. J. Math., 32 (1980), 831-838.
  • 14. M. Katchalski and A.C. Liu, Symmetric and common transversals, Pacific J. Math., 86 (1980), 513-515.
  • 15. M. Katchalski, Thin sets and common transversals, J. Geometry, 14 (1980), 104-107.
  • 16. M. Katchalski and T. Lewis, Cutting families of convex sets, Proc. A.M.S., 79 (1980), 457-461.
  • 17. H.L. Abbott, M. Katchalski and A.C. Liu, An extremal problem in graph theory II, J. Austral, M.S., 29 (1980), 417-424.
  • 18. H. Abbott, M. Katchalski and A.C. Liu, An extremal problem in hypergraph theory, Proc. Conf. Disc. Math. and Comb. Comp., (1980), 74-82.
  • 19. M. Katchalski, M.S. Klamkin and A.C. Liu, An experience in problem solving, American Mathematical Monthly, 81 (1981), 552-556.
  • 20. I. Barany, M. Katchalski and J. Pach, “Quantitative” Helly type theorems, Proc. A.M.S., 86 (1982), 109-114.
  • 21. M. Katchalski and A.C. Liu, Intersection patterns of families of convex sets, Canadian J. of Mathematics, 34 (1982), 921-931.
  • 22. M. Katchalski and T. Lewis, Cutting rectangles in the planes, Discrete Math., 42 (1982), 67-71.
  • 23. H. Abbott and M. Katchalski, On sets of lattice points not containing the vertices of a square, European J. Combinatorics, 3 (1982), 191-193.
  • 24. I. Barany, M. Katchalski and J. Pach, Helly’s theorem with volumes, Amarican Mathematical Monthly, 91 (1982), 362-364.
  • 25. J. Hartman and M. Katchalski, On k-cycled refinements of certain graphs, Canad. Math. Bull, 26 (1983), 152-156.
  • 26. J. Hartman and M. Katchalski, A partition property of k-cycled refinements of graphs, Congressus Numerantium, 44 (1984), 151-154.
  • 27. M. Katchalski, T. Lewis and J. Zaks, Geometric permutations for convex sets, Discrete Mathematics, 54 (1985), 271-284.
  • 28. N. Alon, Z. Furedi and M. Katchalski, Separating pairs of points by standard boxes, European Journal of Combinatorics, 6 (1985), 205-210.
  • 29. M. Katchalski, T. Lewis and A. Liu, Geometric permutations and common transversals, Journal of Discrete and Computational Geometry, 1 (1986), 371-377.
  • 30. M. Katchalski, On a conjecture of Grunbaum on common transversals, Mathematica Scandinavica, 59 (1986), 192-198.
  • 31. M. Katchalski, T. Lewis and A. Liu, Geometric permutations of disjoint translates of convex sets, Discrete Mathematics, 65 (1987), 249-259.
  • 32. H. Abbott and M. Katchalski, Snakes and pseudo snakes in powers of complete graphs, Discrete Mathematics, 68 (1988), 1-8.
  • 33. M. Katchalski and A. Meir, On empty triangles determined by points in the plane, Acta Mathematica Hungarica, 51 (1988), 323-328.
  • 34. H. Abbott and M. Katchalski, On the snake in the box problem, Journal of Combinatorial Theory, Series B, 45 (1988), 13-24.
  • 35. N. Alon, M. Katchalski and W.R. Pulleyblank, Cutting disjoint disks by straight lines, Discrete and Computational Geometry, 4 (1989), 239-243.
  • 36. N. Alon, M. Katchalski and W.R. Pulleyblank, The maximum size of a convex polygon in a restricted set of points in the plane, Discrete and Computational Geometry, 4 (1989), 245-251.
  • 37. N. Alon, M. Katchalski and E. Scheinerman, Not all graphs are T. Graphs, European Journal of Combinatorics, 11 (1990), 7-13.
  • 38. R. Hope and M .Katchalski, Separating plane convex sets, Mathematica Scandinavica, 66 (1990), 44-46.
  • 39. H. Abbott and M. Katchalski, On the construction of snake in the box codes, Utilitas Mathematica, 40 (1991), 97-116.
  • 40. H. Abbott and M. Katchalski, Further results on snakes in powers of complete graphs, Discrete Mathematics, 91 (1991), 111-120.
  • 41. M. Katchalski, T. Lewis and A. Liu, The different ways of stabbing disjoint convex sets, Discrete and Computational Geometry, 7 (1992), 197-206.
  • 42. M. Katchalski and R. Meshulam, An extremal problem for a family of pairs of subspaces, European Journal of Combinatorics, 15 (1994), 253-257
  • 43. H. Abbott, M. Katchalski and B. Zhou, On a conjecture of G.A. Dirac concerning 4-critical planar graphs, Discrete Mathematics, 132 (1994), 367-371.
  • 44. H. Abbott and M. Katchalski, Estimates for snakes and pseudosnakes in K , Utilitas Mathematica, 43 (1993), 97-100.
  • 45. M. Katchalski and J. Pach, Touching convex sets, Canadian Mathematical Bulletin, 37 (1994), 495-504.
  • 46. H. Abbott and M. Katchalski, A Ramsey type problem, ARS Combinatorica, 38 (1994), 57-63.
  • 47. M. Katchalski, W. McCuaig and S. Seager, Ordered colorings, Discrete Mathematics, 142 (1995), 141-154.
  • 48. N. Alon, M Katchalski, A. Liu and B. Zhou, On straight-edge triangulations, Mathematica Scandinavica, 77 (1995), 184-188.
  • 49. M. Katchalski, W. Goddard and D. Kleitman, Forcing disjoint segments in the plane, European Journal of Combinatorics, 17 (1996), 391-395.
  • 50. M. Katchalski and D. Nashtir, On a conjecture of Danzer and Grunbaum, Proc. A.M.S., 124 (1996), 3213-3218.
  • 51. M. Katchalski and H. Last, Geometric graphs with no two edges in convex position, Discrete and Computational Geometry, 19 (1998), 399-404
  • 52. M Katchalski and D. Nashtir, A Helly type conjecture, Discrete and Computatioal Geometry,21(1999),37-43.
  • 53. H. Abbott and M. Katchalski. Covering squares with squares, Discrete and Computational Geometry,24(2000),151-169.
  • 54. A. Asinowski,A. Holmsen and M. Katchalski, The triples of geometric permutations for families of disjoint translates,Discrete Mathematics,241(2001),23-32.
  • 55. A. Asinowski,A.Holmsen,H. Tverberg and M. Katchalski,Geometric permutations for large families of disjoint translates of a convex set,D.C.G.:The Goodman Pollack Festschrift,Editors,Aronov,Basu,Pach and Sharir,Vol.25 of Algorithms and Combinatorics,Springer Verlag Germany,2003.
  • 56. M. Katchalski,S.Suri and Y. Zhou,A constant bound for geometric permutations of disjoint unit balls,DCG,29(2003),161-173.
  • 57. A. Holmsen ,M. Katchalski and T. Lewis,A Helly-type theorem for line transversals to disjoint unit balls,DCG,29 (2003),595-602.
  • 58. A. Asinowski and M. Katchalski,Forbidden families of geometric permutations in R^d,DCG,34 (2005),1-10.
  • 59. A. Asinowski and M. Katchalski, The maximal number of geometric permutations for n disjoint translates of a convex set in R^d, DCG,35 (2006),473-480.