Log in

Relevant bibliographies by topics / Szekeres theorem

Contents

Journal articles
Dissertations / Theses
Book chapters

Academic literature on the topic 'Szekeres theorem'

Author: Grafiati

Published: 4 June 2021

Last updated: 2 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Szekeres theorem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Szekeres theorem"

1

Bárány, Imre, Edgardo Roldán-Pensado, and Géza Tóth. "Erdős–Szekeres Theorem for Lines." Discrete & Computational Geometry 54, no. 3 (2015): 669–85. http://dx.doi.org/10.1007/s00454-015-9705-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Czabarka, Éva, and Zhiyu Wang. "Erdős–Szekeres theorem for cyclic permutations." Involve, a Journal of Mathematics 12, no. 2 (2019): 351–60. http://dx.doi.org/10.2140/involve.2019.12.351.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Koshelev, V. A. "The Erdős-Szekeres theorem and congruences." Mathematical Notes 87, no. 3-4 (2010): 537–42. http://dx.doi.org/10.1134/s0001434610030314.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bárány, I., and P. Valtr. "A Positive Fraction Erdos - Szekeres Theorem." Discrete & Computational Geometry 19, no. 3 (1998): 335–42. http://dx.doi.org/10.1007/pl00009350.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Tóth, G., and P. Valtr. "Note on the Erdos - Szekeres Theorem." Discrete & Computational Geometry 19, no. 3 (1998): 457–59. http://dx.doi.org/10.1007/pl00009363.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Dumitrescu, Adrian. "A Remark on the Erdős-Szekeres Theorem." American Mathematical Monthly 112, no. 10 (2005): 921–24. http://dx.doi.org/10.1080/00029890.2005.11920269.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bialostocki, A., P. Dierker, and B. Voxman. "Some notes on the Erdős-Szekeres theorem." Discrete Mathematics 91, no. 3 (1991): 231–38. http://dx.doi.org/10.1016/0012-365x(90)90232-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Károlyi, Gyula, and József Solymosi. "Erdős–Szekeres theorem with forbidden order types." Journal of Combinatorial Theory, Series A 113, no. 3 (2006): 455–65. http://dx.doi.org/10.1016/j.jcta.2005.04.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kharaghani, H. "New proof of a theorem of Szekeres." Journal of Combinatorial Theory, Series A 40, no. 1 (1985): 169–70. http://dx.doi.org/10.1016/0097-3165(85)90056-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Pór and Valtr. "The Partitioned Version of the Erdős—Szekeres Theorem." Discrete & Computational Geometry 28, no. 4 (2002): 625–37. http://dx.doi.org/10.1007/s00454-002-2894-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Szekeres theorem"

1

Eliáš, Marek. "Erdos-Szekeres type theorems." Master's thesis, 2012. http://www.nusl.cz/ntk/nusl-304489.

Full text

Abstract:

Let P = (p1, p2, . . . , pN ) be a sequence of points in the plane, where pi = (xi, yi) and x1 < x2 < · · · < xN . A famous 1935 Erdős-Szekeres theorem asserts that every such P contains a monotone subsequence S of √ N points. Another, equally famous theorem from the same paper implies that every such P contains a convex or concave subsequence of Ω(log N) points. First we define a (k + 1)-tuple K ⊆ P to be positive if it lies on the graph of a function whose kth derivative is everywhere nonnegative, and similarly for a negative (k + 1)-tuple. Then we say that S ⊆ P is kth-order monotone if its

APA, Harvard, Vancouver, ISO, and other styles

2

Zajíc, Vítězslav. "Konvexně nezávislé podmnožiny konečných množin bodů." Master's thesis, 2011. http://www.nusl.cz/ntk/nusl-313203.

Full text

Abstract:

Let fd(n), n > d ≥ 2, be the smallest positive integer such that any set of fd(n) points, in general position in Rd , contains n points in convex position. Let hd(n, k), n > d ≥ 2 and k ≥ 0, denote the smallest number with the property that in any set of hd(n, k) points, in general position in Rd , there are n points in convex position whose convex hull contains at most k other points. Previous result of Valtr states that h4(n, 0) does not exist for all n ≥ 249. We show that h4(n, 0) does not exist for all n ≥ 137. We show that h3(8, k) ≤ f3(8) for all k ≥ 26, h4(10, k) ≤ f4(10) for all k ≥ 14

APA, Harvard, Vancouver, ISO, and other styles

3

Balko, Martin. "Ramseyovské výsledky pro uspořádané hypergrafy." Doctoral thesis, 2016. http://www.nusl.cz/ntk/nusl-267853.

Full text

Abstract:

Ramsey-type results for ordered hypergraphs Martin Balko Abstract We introduce ordered Ramsey numbers, which are an analogue of Ramsey numbers for graphs with a linear ordering on their vertices. We study the growth rate of ordered Ramsey numbers of ordered graphs with respect to the number of vertices. We find ordered match- ings whose ordered Ramsey numbers grow superpolynomially. We show that ordered Ramsey numbers of ordered graphs with bounded degeneracy and interval chromatic number are at most polynomial. We prove that ordered Ramsey numbers are at most polynomial for ordered graphs wit

APA, Harvard, Vancouver, ISO, and other styles

4

Wun, Fu-Cyuan, and 溫福銓. "Discussing the Happy Ending problem from the Paul Erdős-Szekeres Theory." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/55678263536694566103.

Full text

Abstract:

碩士<br>國立屏東教育大學<br>應用數學系<br>99<br>In 1935, Esther Klein [1] asked, “Is it true that for every n, there is a least value g(n) such that any set of g(n) points in the plane in general position always contains the vertices of a convex n-gon?” This is the “Happy Ending problem” because it led to the marriage of George Szekeres and Esther Klein. In this paper, we show the existence of g(n) and estimate its upper bound and lower bound by using the Erdős-Szekeres Theorem. We also constructing explicit examples for the minimal possible g(n) for a set of g(n) points in the plane in general position must

APA, Harvard, Vancouver, ISO, and other styles

5

Parikshit, K. "Two Player Game Variant Of The Erdos Szekeres Problem." Thesis, 2011. http://etd.iisc.ernet.in/handle/2005/2352.

Full text

Abstract:

The following problem has been known for its beauty and elementary character. The Erd˝os Szekeres problem[7]: For any integer k ≥ 3, determine if there exists a smallest positive integer N(k) such that any set of atleast N(k) points in general position in the plane(i.e no three points are in a line) contains k points that are the vertices of a convex k-gon. The finiteness of (k)is proved by Erd˝os and Szekeres using Ramsey theory[7]. In 1978, Erd˝os [6] raised a similar question on empty convex k-gon (convex k-gon without out any interior points) and it has been extensively studied[18]. Sev

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Szekeres theorem"

1

Bárány, Imre, and Gyula Károlyi. "Problems and Results around the Erdös-Szekeres Convex Polygon Theorem." In Discrete and Computational Geometry. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-47738-1_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Borwein, Peter. "The Erdős—Szekeres Problem." In Computational Excursions in Analysis and Number Theory. Springer New York, 2002. http://dx.doi.org/10.1007/978-0-387-21652-2_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Holmsen, Andreas F. "Erdős–Szekeres Theorems for Families of Convex Sets." In Bolyai Society Mathematical Studies. Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-57413-3_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!