P. Erdos and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2 (1935), 463--470.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....color. The infinite version is similar. Earlier Schur [225] and van der Waerden [247] obtained similar results in number theory. Dilworth s classical theorem [79] for partially ordered sets is another typical example. Ramsey s theorem was rediscovered and applied to geometry by Erdos and Szekeres [96]. They also defined the Ramsey numbers and gave some upper and lower bounds for them. For the graphs G 1 , G 2 , G t , the Graph Ramsey number r(G 1 , G 2 , G t ) is the smallest integer R with the property that any complete graph of at least R vertices whose edges are partitioned ....

....van der Waerden s and Szemeredi s theorem, these had strong influence on basic questions in harmonic analysis or in the geometry of fractals, mentioned in section three. Section 4 surveys development in computational geometry or in the geometry of polytopes related to the Erdos Szekeres s theorem [96]. In section 5 some examples are listed where the probabilistic method has been used and the best constructions for the same problems are mentioned. Information theory applications of Ramsey theory mostly involve finding maximal independent sets for various graphs corresponding to information ....

[Article contains additional citation context not shown here]

P. Erdos and G. Szekeres, A combinatorial problem in geometry, Comp. Math. 2 (1935), 464--470.

....clique of size s. This function was named after the English mathematician Frank P. Ramsey who first showed that it was well defined. Our algorithm in his name, and the associated analysis, provides another proof to an upper bound for the Ramsey function, first proved by Erdos and Szekeres in 1934 [12]. Theorem 2 R(s; t) r(s; t) Define t s (n) minft j r(s; t) ng minft j s t02 ng. Note that if the graph contains no clique of size k 1, the independent set found must be of size at least t k (n) As k colorable graphs are a subset of (k 1) clique free graphs, the same bound holds ....

P. Erdos and G. Szekeres. A combinatorial problem in geometry. Compositio Math., 2:463-- 470, 1935.

....any convex n gon. Suppose otherwise and let e ; e be the edges of the 1 e 2 d 3 d 2 d 1 c 1 c 2 c 3 e 3 Figure 2: Triangles realizing K 3 . n gon and P 1 ; PN the translates of the n gon. Since N = f (3) Gamma 1) 1, by the theorem of Erdos Szekeres [ES] the sequence e 1 ; e N of corresponding translates of edge e (projected into the xy Gammaplane) has a monotone subsequence of length f (3) The corresponding subsequence of polygons must have a subsequence of length f (3) where both the e and e sequences are ....

P. Erdos, Gy. Szekeres, "A Combinatorial Problem in Geometry", Compositio Math. 2 (1935), pages 463--470.

....that does not work for Voronoi diagrams. In dimension d,even first order Voronoi diagrams can have complexity Omega dd=2e )# whereas, the nearest neighbors can still be found in time O(n log n) using Vaidya s algorithm [34] Finally,by applying an old combinatorial result of Erdos and Szekeres [21], we can generalize our techniques to find minimum measure convex polygons and polytopes. Avariant of our technique also yields new algorithms for finding minimum area k point sets in the plane, or minimum boundary measure or volume k point sets in arbitrary dimensions. Our boundary measure ....

....we need a result of the form that, if enough points are given, some k point subset will be convex. Such results are given by Ramsey theory [24]# indeed, the following was one of the seminal results in the development of both Ramsey theory and combinatorial geometry. Lemma 10.1 (Erdos and Szekeres [21]) GivenasetofES 2 (k) k;2 Delta 1 points in general position in the plane, some k points form the vertices of a convex polygon. Lemma 10.2. Given a set of ES d (k) Delta 1 points in general position in IR some k points form the vertices of a convex polytope. Proof: Project any ....

P. Erdos and G. Szekeres. A combinatorial problem in geometry. Compositio Math., 2:463--470, 1935.

....form a convex set. Hence we need a result of the form that, if enough points are given, some subset of them forms a convex set. Such bounds are given 7 by Ramsey theory; indeed the following was one of the seminal results in the development in Ramsey theory [12] Lemma 2. Erdos and Szekeres [10, 12]) Given n = f(k) 2k 4 k 2 1 points in general position, then some k points form the vertices of a convex k gon. # This gives a bound of f(k) O(4 ) Graham et al. 12] also note a lower bound of f(k) # (2 ) and cite as an open problem tightening the gap between these bounds. ....

P. Erdos and G. Szekeres. A combinatorial problem in geometry. Compositio Math. 2 (1935) 463--470.

....they obtained the bounds 2 n 2 1 # g(n) # 2n 4 n 2 1, which have stood unchanged since then. In this paper we remove the 1 from the upper bound for n # 4. In 1935, Paul Erdos and George Szekeres published a short paper A combinatorial problem in geometry [1] which was destined to have a profound influence on the development of combinatorics (and especially Ramsey theory) during the next 60 years (see [3] In particular, in this paper, Erdos and Szekeres rediscovered Ramsey s theorem, which had only just appeared (unknown to them) five years earlier. ....

....in the plane in general position always contains the vertices of a convex n gon # The research of the first author was supported in part by NSF Grant No. DMS 95 04834. 368 F. R. K. Chung and R. L. Graham Fig. 1. Caps and cups. Erdos and Szekeres gave several proofs of the existence of g(n) in [1] and established the following bounds: 2 n 2 1 # g(n) # 2n 4 n 2 1. 1) They also conjectured that the lower bound in (1) in fact always holds with equality. This is known [2] to be the case for n # 5. Despite repeated attempts over the years, no general improvement on ....

[Article contains additional citation context not shown here]

P. Erdos and G. Szekeres, A combinatorial problem in geometry, Compositio Math., 2 (1935), 463-.470.

....two results. The first is due to Klazar and Valtr: Theorem 3.3 ( 6] Let a 1 ; a r be symbols. Consider the word y = a 1 a 2 : a r Gamma1 a r a r Gamma1 a r Gamma2 : a 2 a 1 a 2 a 3 : a r : Then (y; m) O(m) Also, we need the well known 6 Lemma 3. 4 (Erdos Szekeres, [4]) Any sequence of numbers of length (k Gamma 1) 2 1 contains a monotone subsequence of length k. Deducing lemma 3.2 from the above is not difficult. By taking r = k Gamma 1) 2 1 in theorem 3.3 we conclude that there is a c = c(k) such that any (k Gamma 1) 2 1 regular word of ....

P. Erdos, G. Szekeres, A combinatorial problem in geometry, compocito Math. 2 (1935), 464-470.

....no three of the points lie on a line. Decades ago, Erdos, Klein, and Szekeres posed the problem of 1 2 Attila Guly as and L aszl o Szab o determining the maximum number f(k) of points in general position in the plane so that no k points form the vertex set of a convex polygon. Erdos and Szekeres [3] proved that 2 k Gamma2 f(k) 2k Gamma 4 k Gamma 2 ; and conjectured that f(k) is equal to the lower bound. Surprisingly, this conjecture has been verified only for k = 3; 4; 5. Recently, the upper bound has slightly been improved by many authors, see [2, 6, 7] The current record, ....

Erdos, P., Szekeres, Gy.: A combinatorial problem in geometry. Compositio Math. 2 (1935), 463-470.

....boundary of the convex hull of [ r i=1 F i . Here c r is a positive constant depending only on r. This generalizes and sharpens some results of Erdos Szekeres, Bisztriczky Fejes T oth, B ar any Valtr, and others. 1 Introduction In their classical paper written in 1935, Erdos and Szekeres [ES1], E] proved that for every r 3, there exists an integer f(r) such that any set of at least f(r) points in the plane has r elements in convex position. This result has inspired a lot of research in combinatorial geometry and in Ramsey theory (see e.g. BDV] GRS] H] PA] V] It follows ....

P. Erdos and G. Szekeres, A combinatorial problem in geometry, Compositio Mathematica 2 (1935), 463--470.

No context found.

P. Erds and G. Szekeres. A combinatorial problem in geometry. Compositio Math., 2:463470, 1935.

No context found.

P. Erds and G. Szekeres. A combinatorial problem in geometry. Compositio Math., 2:463470, 1935.

....is in general position if no three of the points are collinear. Such a set S will be referred to as an n set. S is in convex position if every point of S appears on the boundary of conv(S) the convex hull of S. The following result is commonly called the Erdos Szekeres theorem: Theorem 1. 1 [13] For every positive integer m there exists a smallest integer f(m) such that any n set, n f(m) contains an m subset of points in convex position. This result has been attracting the attention of many researchers, both because of its beauty and elementary statement, and because finding the ....

P. Erdos and G. Szekeres. A combinatorial problem in geometry. Compositio Math., 2:463--470, 1935.

....infinitely many straight line segments such that any three are in convex position, but no four are. However, there is a function M (n) such that every family of at least M (n) segments, any four of which are in convex position, has n members in convex position. 1 Introduction Erdos and Szekeres [ES1], ES2] proved that any set of more than 2n Gamma4 n Gamma2 points in general position in the plane contains n points which are in convex position, i.e. they form the vertex set of a convex n gon. T. Bisztriczky and G. Fejes T oth [BF1] BF2] F] extended this result to families of convex ....

P. Erdos and G. Szekeres, A combinatorial problem in geometry, Compositio Mathematica 2 (1935), 463--470.

....the maximum size of a family F with the property that any k members of F are in convex position, but no n are. In particular, for k = 3, we improve the triply exponential upper bound of T. Bisztriczky and G. Fejes T oth by showing that P 3 (n) 16 . 1 Introduction In their classical paper [ES1], Erdos and Szekeres proved that any set of more than points in general position in the plane contains n points which are in convex position, i.e. they form the vertex set of a convex n gon. T. Bisztriczky and G. Fejes T oth [BF1] F] extended this result to families of convex sets. ....

P. Erdos and G. Szekeres, A combinatorial problem in geometry, Compositio Mathematica 2 (1935), 463--470.

No context found.

P. Erdos and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2(1935), 463-470.

No context found.

P. Erdos and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2 (1935), 463--470.

No context found.

Paul Erdos and George Szekeres. A combinatorial problem in geometry. Compositio Mathematica, pages 463--470, 1935.

No context found.

P. Erdos and G. Szekeres, "A combinatorial problem in geometry", Compositio Math., 2, 463-- 470, 1935.

No context found.

P. Erdos and G. K. Szekeres. A combinatorial problem in geometry. Compositio Math., 2:463-- 470, 1935.

No context found.

P.Erdos and G.Szekeres, A Combinatorial Problem in Geometry,Composito Mathematica 2, 463-470 (1935).

No context found.

P. Erdos, G. Szekeres, "A combinatorial problem in geometry," Compositio Math., 2(1935), pp. 463--470.

No context found.

Paul Erdos and George Szekeres. A combinatorial problem in geometry. Compositio Mathematica, pages 463--470, 1935.

No context found.

P. Erdos, G. Szekeres, "A combinatorial problem in geometry," Compositio Math., 2(1935), pp. 463--470. 181

No context found.

Pal Erdos and George Szekeres, A combinatorial problem in geometry,Compositio Math. 2 (1935), 463--470.

No context found.

P. Erdos and G. Szekeres, "A combinatorial problem in geometry", Compositio Math., 2, 463-- 470, 1935. 14

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC