期刊文献+

On the ErdÖs Distance Conjecture in Geometry

On the ErdÖs Distance Conjecture in Geometry
下载PDF
导出
摘要 ErdÖs asks if it is possible to have n points in general position in the plane (no three on a line or four on a circle) such that for every i (1≤i≤n-1 ) there is a distance determined by the points that occur exactly i times. So far some examples have been discovered for 2≤n≤8 [1] [2]. A solution for the 8 point is provided by I. Palasti [3]. Here two other possible solutions for the 8 point case as well as all possible answers to 4 - 7 point cases are provided and finally a brief discussion on the generalization of the problem to higher dimensions is given. ErdÖs asks if it is possible to have n points in general position in the plane (no three on a line or four on a circle) such that for every i (1≤i≤n-1 ) there is a distance determined by the points that occur exactly i times. So far some examples have been discovered for 2≤n≤8 [1] [2]. A solution for the 8 point is provided by I. Palasti [3]. Here two other possible solutions for the 8 point case as well as all possible answers to 4 - 7 point cases are provided and finally a brief discussion on the generalization of the problem to higher dimensions is given.
作者 Amir Jafari Amin Najafi Amin Amir Jafari;Amin Najafi Amin(Department of Mathematics, Sharif University of Technology, Tehran, Iran)
出处 《Open Journal of Discrete Mathematics》 2016年第3期109-160,共52页 离散数学期刊(英文)
关键词 ErdÖs Distance Problem General Position Graph Pattern Distance Distribution ErdÖs Distance Problem General Position Graph Pattern Distance Distribution
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部