D. Kleitman and L. Pachter, “Finding Convex Sets among Points in the Plane,” Discrete & Computational Geometry, Vol. 19, No. 3, 1998, pp. 405-410. doi10.1007/PL00009358 - References

Browse Menu >>

Browse Subjects >>

Biomedical & Life Sciences

Business & Economics

Chemistry & Materials Science

Computer Science & Communications

Earth & Environmental Sciences

Engineering

Medicine & Healthcare

Physics & Mathematics

Social Sciences & Humanities

Why Us? >>

- Open Access
- Peer-reviewed
- Rapid publication
- Lifetime hosting
- Free indexing service
- Free promotion service
- More citations
- Search engine friendly

Free SCIRP Newsletters>>

Add your e-mail address to receive free newsletters from SCIRP.

Contact Us >>

customer@scirp.org

+86 18163351462(WhatsApp)

1655362766

Paper Publishing WeChat

Book Publishing WeChat

(or Email:book@scirp.org)

Article citations
More>>

D. Kleitman and L. Pachter, “Finding Convex Sets among Points in the Plane,” Discrete & Computational Geometry, Vol. 19, No. 3, 1998, pp. 405-410. doi:10.1007/PL00009358

has been cited by the following article:

TITLE: On Some Numbers Related to the Erdös-Szekeres Theorem

AUTHORS: Mark J. Nielsen, William Webb

KEYWORDS: Erdos-Szekeres Theorem; Combinatorial Geometry

JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.3 No.3, July 12, 2013

ABSTRACT: A crossing family of segments is a collection of segments each pair of which crosses. Given positive integers j and k,a(j,k) grid is the union of two pairwise-disjoint collections of segments (with j and k members, respectively) such that each segment in the first collection crosses all members of the other. Let c(k) be the least integer such that any planar set of c(k) points in general position generates a crossing family of k segments. Also let #(j,k) be the least integer such that any planar set of #(j,k) points in general position generates a (j,k)-grid. We establish here the facts 9≤c(3)≤16 and #(1,2)=8.