A Ramsey-type result for convex sets
暂无分享,去创建一个
János Pach | Jiří Matoušek | D. G. Larman | J. Pach | D. Larman | Jenő Törőcsik | J. Matoušek | Jenő Törőcsik
[1] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .
[2] R. P. Dilworth,et al. A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .
[3] J. Pach. Decomposition of multiple packing and covering , 1980 .
[4] András Gyárfás,et al. Covering and coloring problems for relatives of intervals , 1985, Discret. Math..
[5] R. Rado,et al. Covering Theorems for Ordered Sets , 1948 .
[6] H. Tietze,et al. Über das Problem der Nachbargebiete im Raum , 1905 .
[7] F. Frances Yao,et al. Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[8] P. Erdös. Some remarks on the theory of graphs , 1947 .