{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:22Z","timestamp":1725761122908},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_32","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T00:28:55Z","timestamp":1385944135000},"page":"364-375","source":"Crossref","is-referenced-by-count":0,"title":["A Ramsey-Type Result for Geometric \u2113-Hypergraphs"],"prefix":"10.1007","author":[{"given":"Dhruv","family":"Mubayi","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Suk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/0097-3165(80)90030-8","volume":"29","author":"M. Ajtai","year":"1980","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: A note on Ramsey numbers. J. Combin. Theory Ser. A\u00a029, 354\u2013360 (1980)","journal-title":"J. Combin. Theory Ser. A"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"\u00c1brego, B.M., Fern\u00e1ndez-Merchant, S., Salazar, G.: The rectilinear crossing number of K\n                           \n                    n\n                  : Closing in (or are we?), Thirty Essays on Geometric Graph Theory. In: Pach, J. (ed.) Algorithms and Combinatorics, vol.\u00a029, pp. 5\u201318. Springer (2012)","DOI":"10.1007\/978-1-4614-0110-0_2"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01215345","volume":"14","author":"B. Aronov","year":"1994","unstructured":"Aronov, B., Erd\u0151s, P., Goddard, W., Kleitman, D.J., Klugerman, M., Pach, J., Schulman, L.J.: Crossing families. Combinatorica\u00a014, 127\u2013134 (1994)","journal-title":"Combinatorica"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.aim.2009.02.018","volume":"221","author":"T. Bohman","year":"2009","unstructured":"Bohman, T.: The triangle-free process. Adv. Math.\u00a0221, 1653\u20131677 (2009)","journal-title":"Adv. Math."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00222-010-0247-x","volume":"181","author":"T. Bohman","year":"2010","unstructured":"Bohman, T., Keevash, P.: The early evolution of the H-free process. Invent. Math.\u00a0181, 291\u2013336 (2010)","journal-title":"Invent. Math."},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1090\/S0894-0347-09-00645-6","volume":"23","author":"D. Conlon","year":"2010","unstructured":"Conlon, D., Fox, J., Sudakov, B.: Journal of the American Mathematical Society\u00a023, 247\u2013266 (2010)","journal-title":"Journal of the American Mathematical Society"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/PL00009365","volume":"19","author":"T. Dey","year":"1998","unstructured":"Dey, T., Pach, J.: Extremal problems for geometric hypergraphs. Discrete Comput. Geom.\u00a019, 473\u2013484 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. of Math.\u00a051, 161\u2013166 (1950)","journal-title":"Ann. of Math."},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","volume":"53","author":"P. Erd\u0151s","year":"1947","unstructured":"Erd\u0151s, P.: Some remarks on the theory of graphs. Bull. Amer. Math. Soc.\u00a053, 292\u2013294 (1947)","journal-title":"Bull. Amer. Math. Soc."},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01886396","volume":"16","author":"P. Erd\u0151s","year":"1965","unstructured":"Erd\u0151s, P., Hajnal, A., Rado, R.: Partition relations for cardinal numbers. Acta Math. Acad. Sci. Hungar.\u00a016, 93\u2013196 (1965)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1112\/plms\/s3-2.1.417","volume":"3","author":"P. Erd\u0151s","year":"1952","unstructured":"Erd\u0151s, P., Rado, R.: Combinatorial theorems on classifications of subsets of a given set. Proc. London Math. Soc.\u00a03, 417\u2013439 (1952)","journal-title":"Proc. London Math. Soc."},{"key":"32_CR12","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math.\u00a02, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"issue":"4","key":"32_CR13","first-page":"53","volume":"3","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Szekeres, G.: On some extremum problems in elementary geometry. Ann. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math.\u00a03(4), 53\u201362 (1960-1961)","journal-title":"Ann. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math."},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1112\/plms\/pds018","volume":"105","author":"J. Fox","year":"2012","unstructured":"Fox, J., Pach, J., Sudakov, B., Suk, A.: Erd\u0151s-Szekeres-type theorems for monotone paths and convex bodies. Proceedings of the London Mathematical Society\u00a0105, 953\u2013982 (2012)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"32_CR15","volume-title":"Ramsey Theory","author":"R.L. Graham","year":"1990","unstructured":"Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory, 2nd edn. Wiley, New York (1990)","edition":"2"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0166-218X(00)00234-1","volume":"109","author":"G. K\u00e1rolyi","year":"2001","unstructured":"K\u00e1rolyi, G.: Ramsey-remainder for convex sets and the Erd\u0151s-Szekeres theorem. Dsicrete Appl. Math.\u00a0109, 163\u2013175 (2001)","journal-title":"Dsicrete Appl. Math."},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/PL00009317","volume":"18","author":"G. K\u00e1rolyi","year":"1997","unstructured":"K\u00e1rolyi, G., Pach, J., T\u00f3th, G.: Ramsey-type results for geometric graphs, I. Disc. Comp. Geom.\u00a018, 247\u2013255 (1997)","journal-title":"Disc. Comp. Geom."},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/PL00009391","volume":"20","author":"G. K\u00e1rolyi","year":"1998","unstructured":"K\u00e1rolyi, G., Pach, J., T\u00f3th, G., Valtr, P.: Ramsey-type results for geometric graphs, II. Disc. Comp. Geom.\u00a020, 375\u2013388 (1998)","journal-title":"Disc. Comp. Geom."},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00454-003-0009-4","volume":"30","author":"G. K\u00e1rolyi","year":"2003","unstructured":"K\u00e1rolyi, G., Valtr, P.: Point configurations in d-space without large subsets in convex position. Disc. Comp. Geom.\u00a030, 277\u2013286 (2003)","journal-title":"Disc. Comp. Geom."},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/rsa.3240070302","volume":"7","author":"J.H. Kim","year":"1995","unstructured":"Kim, J.H.: The Ramsey number R(3,t) has order of magnitude t\n                           2\/logt. Random Structures Algorithms\u00a07, 173\u2013207 (1995)","journal-title":"Random Structures Algorithms"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer-Verlag New York, Inc. (2002)","DOI":"10.1007\/978-1-4613-0039-7"},{"key":"32_CR22","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial geometry","author":"J. Pach","year":"1995","unstructured":"Pach, J., Agarwal, P.: Combinatorial geometry. Wiley-Interscience, New York (1995)"},{"key":"32_CR23","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F.P. Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem in formal logic. Proc. London Math. Soc.\u00a030, 264\u2013286 (1930)","journal-title":"Proc. London Math. Soc."},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Suk, A.: A note on geometric 3-hypergraphs, Thirty Essays on Geometric Graph Theory. In: Pach, J. (ed.) Algorithms and Combinatorics, vol.\u00a029, pp. 489\u2013498. Springer (2012)","DOI":"10.1007\/978-1-4614-0110-0_26"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511987045"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Wagner, U.: k-sets and k-facets, Discrete and Computational Geometry - 20 Years Later. In: Goodman, E., Pach, J., Pollack, R. (eds.) Contemporary Mathematics, vol.\u00a0453, pp. 443\u2013514. American Mathematical Society (2008)","DOI":"10.1090\/conm\/453\/08810"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T21:53:51Z","timestamp":1558734831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}