{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:35Z","timestamp":1725502055793},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77537-9_4","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T14:50:55Z","timestamp":1201704655000},"page":"13-24","source":"Crossref","is-referenced-by-count":0,"title":["A Bipartite Strengthening of the Crossing Lemma"],"prefix":"10.1007","author":[{"given":"Jacob","family":"Fox","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Mathematical Studies","first-page":"9","volume-title":"Theory and Practice of Combinatorics","author":"M. Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M., Szemer\u00e9di, E.: Crossing-free subgraphs. In: Theory and Practice of Combinatorics. Mathematical Studies, vol.\u00a060, pp. 9\u201312. North-Holland, Amsterdam (1982)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"T.K. Dey","year":"1998","unstructured":"Dey, T.K.: Improved bounds for planar k-sets and related problems. Discrete Comput. Geom.\u00a019, 373\u2013382 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1006\/jnth.1999.2386","volume":"83","author":"G. Elekes","year":"2000","unstructured":"Elekes, G., Nathanson, M.B., Ruzsa, I.Z.: Convexity and sumsets. J.\u00a0Number Theory\u00a083, 194\u2013201 (2000)","journal-title":"J.\u00a0Number Theory"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"248","DOI":"10.2307\/2305092","volume":"53","author":"P. Erd\u0151s","year":"1946","unstructured":"Erd\u0151s, P.: On sets of distances of n points, Amer. Math. Monthly\u00a053, 248\u2013250 (1946)","journal-title":"Amer. Math. Monthly"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s11083-006-9043-z","volume":"23","author":"J. Fox","year":"2006","unstructured":"Fox, J.: A bipartite analogue of Dilworth\u2019s theorem, Order\u00a023, 197\u2013209 (2006)","journal-title":"Order"},{"key":"4_CR6","unstructured":"Fox, J., Pach, J., T\u00f3th, C.D.: Intersection patterns of curves, manuscript, Cf (2007), http:\/\/math.nyu.edu\/~pach\/publications\/justcurves050907.pdf"},{"key":"4_CR7","unstructured":"Fox, J., Pach, J., T\u00f3th, C.D.: Tur\u00e1n-type results for partial orders and intersection graphs of convex sets, Israel J. Math. (to appear, 2007)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(83)90019-5","volume":"43","author":"M.C. Golumbic","year":"1983","unstructured":"Golumbic, M.C., Rotem, D., Urrutia, J.: Comparability graphs and intersection graphs. Discrete Math.\u00a043, 37\u201346 (1983)","journal-title":"Discrete Math."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-52921-7_83","volume-title":"Algorithms","author":"H. Gazit","year":"1990","unstructured":"Gazit, H., Miller, G.L.: Planar separators and the Euclidean norm. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol.\u00a0450, pp. 338\u2013347. Springer, Heidelberg (1990)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Katz, N.H., Tardos, G.: A new entropy inequality for the Erd\u0151s distance problem. In: Towards a theory of geometric graphs. Contemp. Math. AMS, vol.\u00a0342, pp. 119\u2013126 (2004)","DOI":"10.1090\/conm\/342\/06136"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.jctb.2003.09.002","volume":"92","author":"P. Kolman","year":"2004","unstructured":"Kolman, P., Matou\u0161ek, J.: Crossing number, pair-crossing number, and expansion. J. Combin. Theory Ser. B\u00a092, 99\u2013113 (2004)","journal-title":"J. Combin. Theory Ser. B"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01744433","volume":"17","author":"T. Leighton","year":"1984","unstructured":"Leighton, T.: New lower bound techniques for VLSI. Math. Systems Theory\u00a017, 47\u201370 (1984)","journal-title":"Math. Systems Theory"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math.\u00a036, 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08, 261\u2013277 (1988)","journal-title":"Combinatorica"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00454-006-1264-9","volume":"36","author":"J. Pach","year":"2006","unstructured":"Pach, J., Radoi\u010di\u0107, R., Tardos, G., T\u00f3th, G.: Improving the Crossing Lemma by finding more crossings in sparse graphs. Discrete Comput. Geom.\u00a036, 527\u2013552 (2006)","journal-title":"Discrete Comput. Geom."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02086610","volume":"16","author":"J. Pach","year":"1996","unstructured":"Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. Algorithmica\u00a016, 111\u2013117 (1996)","journal-title":"Algorithmica"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1017\/S0963548397003192","volume":"7","author":"J. Pach","year":"1998","unstructured":"Pach, J., Sharir, M.: On the number of incidences between points and curves. Combin. Probab. Comput.\u00a07(1), 121\u2013127 (1998)","journal-title":"Combin. Probab. Comput."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/jcta.2001.3184","volume":"96","author":"J. Pach","year":"2001","unstructured":"Pach, J., Solymosi, J.: Crossing patterns of segments. J. Combin. Theory Ser. A\u00a096, 316\u2013325 (2001)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"4","key":"4_CR19","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1007\/s4540010011","volume":"24","author":"J. Pach","year":"2000","unstructured":"Pach, J., Spencer, J., T\u00f3th, G.: New bounds on crossing numbers. Discrete Comput. Geom.\u00a024(4), 623\u2013644 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/jctb.2000.1978","volume":"80","author":"J. Pach","year":"2000","unstructured":"Pach, J., T\u00f3th, G.: Which crossing number is it anyway? J. Combin. Theory Ser. B\u00a080, 225\u2013246 (2000)","journal-title":"J. Combin. Theory Ser. B"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s003730200063","volume":"18","author":"J. Pach","year":"2002","unstructured":"Pach, J., Tardos, G.: Isosceles triangles determined by a planar point set. Graphs Combin.\u00a018, 769\u2013779 (2002)","journal-title":"Graphs Combin."},{"key":"4_CR22","first-page":"150","volume":"15","author":"J. Pach","year":"2006","unstructured":"Pach, J., T\u00f3th, G.: Comment on Fox News. Geombinatorics\u00a015, 150\u2013154 (2006)","journal-title":"Geombinatorics"},{"key":"4_CR23","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s00454-001-0009-z","volume":"25","author":"J. Solymosi","year":"2001","unstructured":"Solymosi, J., T\u00f3th, C.D.: Distinct distances in the plane. Discrete Comput. Geom.\u00a025, 629\u2013634 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"4_CR24","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1007\/s00454-002-2896-z","volume":"28","author":"J. Solymosi","year":"2002","unstructured":"Solymosi, J., Tardos, G., T\u00f3th, C.D.: The k most frequent distances in the plane. Discrete Comput. Geom.\u00a028, 639\u2013648 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1017\/S0963548397002976","volume":"6","author":"L.A. Sz\u00e9kely","year":"1997","unstructured":"Sz\u00e9kely, L.A.: Crossing numbers and hard Erd\u0151s problems in discrete geometry. Combin. Probab. Comput.\u00a06, 353\u2013358 (1997)","journal-title":"Combin. Probab. Comput."},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02579194","volume":"3","author":"E. Szemer\u00e9di","year":"1983","unstructured":"Szemer\u00e9di, E., Trotter, W.T.: Extremal problems in discrete geometry. Combinatorica\u00a03, 381\u2013392 (1983)","journal-title":"Combinatorica"},{"key":"4_CR27","series-title":"Cambridge Studies in Advanced Mathematics, 105","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511755149","volume-title":"Additive combinatorics","author":"T. Tao","year":"2006","unstructured":"Tao, T., Vu, V.: Additive combinatorics. Cambridge Studies in Advanced Mathematics, 105. Cambridge University Press, Cambridge (2006)"},{"key":"4_CR28","unstructured":"Valtr, P.: On the pair-crossing number. In: Combinatorial and computational geometry, vol.\u00a052, pp. 569\u2013575. MSRI Publications, Cambridge Univ. Press (2005)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77537-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:15:57Z","timestamp":1619522157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775362","9783540775379"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_4","relation":{},"subject":[]}}