Some geometric applications of Dilworth’s theorem
暂无分享,去创建一个
[1] R. Graham,et al. Ramsey theory (2nd ed.) , 1990 .
[2] János Pach,et al. A Ramsey-type result for convex sets , 1994 .
[3] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[4] R. P. Dilworth,et al. A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .
[5] Paul Seymour,et al. Bounding the vertex cover number of a hypergraph , 1994, Comb..
[6] E. Szemerédi,et al. Crossing-Free Subgraphs , 1982 .
[7] Noga Alon,et al. Disjoint edges in geometric graphs , 1989, Discret. Comput. Geom..
[8] P. Erdös. On Sets of Distances of n Points , 1946 .
[9] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .
[10] András Gyárfás,et al. Covering and coloring problems for relatives of intervals , 1985, Discret. Math..