|
[26] Discrete convex functions and proof of the six circle conjecture of Fejes Tóth (with I. Bárány and Z. Füredi), Can. J. Math. 36 (1984), 569-576. [27] On disjointly representable sets (with P. Frankl), Combinatorica 4 (1984), 39-45. [28] The Analysis Incarnate -- Leonhard Euler, Magyar Tudomány 1984/3, 203-223 (in Hungarian). [29] The Mathematician of the Enlightenment, Középiskolai Matematikai Lapok 34 (1984), 1-3 (in Hungarian). [30] Remarks on stars and independent sets (with P. Erdős), in: Aspects of Topology (I. M. James and E. H. Kronheimer, eds.), Cambridge University Press, 1984, 307-314. [31] A point set everywhere dense in the plane (with K. Bezdek), Elemente der Mathematik, 40 (1985), 81-84. [32] How to build a barricade (with P. Frankl and V. Rödl), Monatshefte für Mathematik 93 (1984), 93-98. [33] Maximal volume enclosed by plates and proof of the chessboard conjecture (with I. Bárány, K. Böröczky and E. Makai, Jr.), Discr. Math. 60 (1986), 101-120. [34] Universal graphs without large bipartite subgraphs (with P. Komjáth), Mathematika, 31 (1984), 282-290. [35] 2-super-universal graphs (with L. Surányi), Proceedings of the Fourth International Graph Theory Conference, Kalamazoo, 1984, John Wiley (1985), 623-636. [36] Bounding one-way differences (with P. Frankl and Z. Füredi), Graphs and Combinatorics 3 (1987), 341-347. [37] Covering the plane with convex polygons, Discr. and Comput. Geometry 1 (1986), 73-81. [38] On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles (with K. Kedem, R. Livne and M. Sharir), Discr. and Comput. Geometry 1 (1986), 59-71. [39] How to make a graph bipartite (with P. Erdős, R. Faudree and J. Spencer), J. Combin. Th. Series B 45 (1988), 86-98. [40] On the mean distance between points of a graph (with P. Erdős and J. Spencer), 250th Anniversary Conference on Graph Theory (Fort Wayne, 1986), Congressus Numerantium 64 (1988), 121-124. [41] On the big unsolved problems in elementary geometry, Magyar Tudomány 1986/2, 120-131 (in Hungarian). [42] Cutting a graph into dissimilar halves (with P. Erdős, M. Goldberg and J. Spencer), J. Graph Theory 12 (1988), 121-131. [43] An upper bound for families of linearly related plane convex sets (with T. Bisztriczky), Archiv der Math. 50 (1988), 56-58. [44] Repeated distances in space (with D. Avis and P. Erdős), Graphs and Combinatorics 4 (1988), 207-217. [45] 100 Research Problems in Discrete Geometry (with W. O. J. Moser), mimeographed . Research Problems in Discrete Geometry (with P. Brass and W. Moser), Springer-Verlag, New York, 2005. [46] Note on vertex-partitions of infinite graphs (with J. Spencer), Discr. Math. 79 (1989/90), 107-108. [47] Explicit codes with low covering radius (with J. Spencer), IEEE Transactions of Information Theory 34 (1988), 1281-1285. [48] An extremal problem on Kr-free graphs (with P. Frankl), J. Graph Theory 12 (1988), 519-523. [49] Decomposition problems for multiple coverings with unit balls (with P. Mani), manuscript. [50] Radius, diameter and minimum degree (with P. Erdős, R. Pollack and Zs. Tuza), Journal of Combinatorial Theory B 47 (1989), 73-79. |
|