{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:10:01Z","timestamp":1737288601568,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_31","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"328-337","source":"Crossref","is-referenced-by-count":2,"title":["Unavoidable Configurations in Complete Topological Graphs"],"prefix":"10.1007","author":[{"given":"J\u00e1nos","family":"Pach","sequence":"first","affiliation":[]},{"given":"G\u00e9za","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"31_CR1","first-page":"2","volume":"3","author":"S. Avital","year":"1966","unstructured":"S. Avital and H. Hanani: Graphs (Hebrew), Gilyonot Lematematika 3 (1966), 2\u20138.","journal-title":"Gilyonot Lematematika"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/jgt.3190120302","volume":"12","author":"D. Archdeacon","year":"1988","unstructured":"D. Archdeacon and B. R. Richter: On the parity of crossing numbers, J. Graph Theory 12 (1988), 307\u2013310.","journal-title":"J. Graph Theory"},{"key":"31_CR3","first-page":"169","volume":"6","author":"Ch. J. Colbourn","year":"1981","unstructured":"Ch. J. Colbourn: On drawings of complete graphs, J. Combin. Inform. System Sci. 6 (1981), 169\u2013172.","journal-title":"J. Combin. Inform. System Sci."},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/PL00009495","volume":"23","author":"G. Cairns","year":"2000","unstructured":"G. Cairns and Y. Nikolayevsky: Bounds for generalized thrackles, Discrete Comput. Geom. 23 (2000), 191\u2013206.","journal-title":"Discrete Comput. Geom."},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(76)90022-8","volume":"21","author":"G. Ehrlich","year":"1976","unstructured":"G. Ehrlich, S. Even, and R. E. Tarjan: Intersection graphs of curves in the plane, J. Combinatorial Theory, Ser. B 21 (1976), 8\u201320.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"52","DOI":"10.2307\/2319261","volume":"80","author":"P. Erd\u0151s","year":"1973","unstructured":"P. Erd\u0151s and R. K. Guy: Crossing number problems, Amer. Math. Monthly 80 (1973), 52\u201358.","journal-title":"Amer. Math. Monthly"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0166-218X(89)90045-0","volume":"25","author":"P. Erd\u0151s","year":"1989","unstructured":"P. Erd\u0151s and A. Hajnal: Ramsey-type theorems, Discrete Appl. Math. 25 (1989), 37\u201352.","journal-title":"Discrete Appl. Math."},{"key":"31_CR8","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"P. Erd\u0151s and G. Szekeres: A combinatorial problem in geometry, Compositio Mathematica 2 (1935), 463\u2013470.","journal-title":"Compositio Mathematica"},{"key":"31_CR9","first-page":"53","volume":"III\u2013IV","author":"P. Erd\u0151s","year":"1960\u201361","unstructured":"P. Erd\u0151s and G. Szekeres: On some extremum problems in elementary geometry, Ann. Universitatis Scientiarum Budapestinensis, E\u00f6tv\u00f6s, Sectio Mathematica III\u2013IV (1960\u201361), 53\u201362.","journal-title":"Ann. Universitatis Scientiarum Budapestinensis, E\u00f6tv\u00f6s, Sectio Mathematica"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M. R. Garey","year":"1983","unstructured":"M. R. Garey and D. S. Johnson: Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods 4 (1983), 312\u2013316.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P. Gritzmann","year":"1991","unstructured":"P. Gritzmann, B. Mohar, J. Pach, and R. Pollack: Embedding a planar triangulation with vertices at specified points, Amer. Math. Monthly 98 (1991), 165\u2013166.","journal-title":"Amer. Math. Monthly"},{"key":"31_CR12","unstructured":"H.-D. Gronau and H. Harborth: Numbers of nonisomorphic drawings for small graphs, in: Proceedings of the Twentieth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1989), Congr. Numer. 71 (1990), 105\u2013114."},{"key":"31_CR13","first-page":"63","volume-title":"Proof Techniques in Graph Theory","author":"R. K. Guy","year":"1969","unstructured":"R. K. Guy: The decline and fall of Zarankiewicz\u2019s theorem, in: Proof Techniques in Graph Theory, Academic Press, New York, 1969, 63\u201369."},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0095-8956(74)90035-5","volume":"17","author":"H. Harborth","year":"1974","unstructured":"H. Harborth and I. Mengersen: Edges without crossings in drawings of complete graphs, J. Combinatorial Theory, Ser. B 17 (1974), 299\u2013311.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"H. Harborth and I. Mengersen: Edges with at most one crossing in drawings of the complete graph, in: Topics in Combinatorics and Graph Theory (Oberwolfach, 1990), Physica, Heidelberg, 1990, 757\u2013763.","DOI":"10.1007\/978-3-642-46908-4_85"},{"key":"31_CR16","unstructured":"H. Harborth and I. Mengersen: Drawings of the complete graph with maximum number of crossings, in: Proceedings of the Twenty-third Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1992), Congr. Numer. 88 (1992), 225\u2013228."},{"key":"31_CR17","first-page":"151","volume":"11","author":"H. Harborth","year":"1995","unstructured":"H. Harborth, I. Mengersen, and R. H. Schelp: The drawing Ramsey number Dr(Kn), Australasian J. Combinatorics 11 (1995), 151\u2013156.","journal-title":"Australasian J. Combinatorics"},{"key":"31_CR18","unstructured":"H. Harborth and Ch. Th\u00fcrmann: Minimum number of edges with at most s crossings in drawings of the complete graph, in: Proceedings of the Twenty-fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1994), Congr. Numer. 102 (1994), 83\u201390."},{"key":"31_CR19","unstructured":"Y. S. Kupitz: Extremal Problems in Combinatorial Geometry, Lecture Notes Series 53, Aarhus Universitet, Matematisk Institut, Aarhus, 1979."},{"key":"31_CR20","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/PL00009322","volume":"18","author":"L. Lov\u00e1sz","year":"1997","unstructured":"L. Lov\u00e1sz, J. Pach, and M. Szegedy: On Conway\u2019s thrackle conjecture, Discrete and Computational Geometry 18 (1997), 369\u2013376.","journal-title":"Discrete and Computational Geometry"},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/mana.19780850110","volume":"85","author":"I. Mengersen","year":"1978","unstructured":"I. Mengersen: Die Maximalzahl von kreuzungsfreien Kanten in Darstellungen von vollst\u00e4ndigen n-geteilten Graphen (German), Math. Nachr. 85 (1978), 131\u2013139.","journal-title":"Math. Nachr."},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"J. Pach: Geometric graph theory, in: Surveys in Combinatorics, 1999 (Canterbury), London Math. Soc. Lecture Note Ser. 267, Cambridge Univ. Press, Cambridge, 1999, 167\u2013200.","DOI":"10.1017\/CBO9780511721335.007"},{"key":"31_CR23","doi-asserted-by":"crossref","unstructured":"J. Pach and P. K. Agarwal: Combinatorial Geometry, Wiley-Interscience, New York, 1995.","DOI":"10.1002\/9781118033203"},{"key":"31_CR24","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02086610","volume":"16","author":"J. Pach","year":"1996","unstructured":"J. Pach, F. Shahrokhi, and M. Szegedy: Applications of crossing numbers, Algorithmica 16 (1996), 111\u2013117.","journal-title":"Algorithmica"},{"key":"31_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02574361","volume":"12","author":"J. Pach","year":"1994","unstructured":"J. Pach and J. T\u00f6r\u0151csik: Some geometric applications of Dilworth\u2019s theorem, Discrete and Computational Geometry 12 (1994), 1\u20137.","journal-title":"Discrete and Computational Geometry"},{"key":"31_CR26","doi-asserted-by":"crossref","unstructured":"J. Pach and G. T\u00f6th: Which crossing number is it, anyway? Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998, 617\u2013626.","DOI":"10.1109\/SFCS.1998.743512"},{"key":"31_CR27","unstructured":"G. Ringel: Extremal problems in the theory of graphs, in: Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), Publ. House Czechoslovak Acad. Sci., Prague, 1964, 85\u201390."},{"key":"31_CR28","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/PL00009363","volume":"19","author":"G. T\u00f3th","year":"1998","unstructured":"G. T\u00f3th and P. Valtr: Note on the Erd\u00f6s-Szekeres theorem, Discrete Comput. Geom. 19 (1998), 457\u2013459.","journal-title":"Discrete Comput. Geom."},{"key":"31_CR29","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1002\/jgt.3190010105","volume":"1","author":"P. Tur\u00e1n","year":"1977","unstructured":"P. Tur\u00e1n: A note of welcome, J. Graph Theory 1 (1977), 7\u20139.","journal-title":"J. Graph Theory"},{"key":"31_CR30","unstructured":"D. R. Woodall: Thrackles and deadlock, in: Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), Academic Press, London, 1971, 335\u2013347."},{"key":"31_CR31","first-page":"15","volume-title":"Selected Topics in Graph Theory","author":"A. T. White","year":"1983","unstructured":"A. T. White and L. W. Beineke: Topological graph theory, in: Selected Topics in Graph Theory (L. W. Beineke and R. J. Wilson., eds.), Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], London-New York, 1983, 15\u201349."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:46:23Z","timestamp":1737287183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}