{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:20:42Z","timestamp":1761805242585},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1007\/s00373-005-0612-5","type":"journal-article","created":{"date-parts":[[2005,10,25]],"date-time":"2005-10-25T09:35:17Z","timestamp":1130232917000},"page":"293-300","source":"Crossref","is-referenced-by-count":29,"title":["A Lower Bound for the Rectilinear Crossing Number"],"prefix":"10.1007","volume":"21","author":[{"given":"Bernardo M.","family":"\u00c1brego","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia","family":"Fern\u00e1ndez-Merchant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"612_CR1","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.: On the crossing number of complete graphs. In: Proc. 18th Ann ACM Symp Comp Geom., Barcelona Spain, 2002, pp. 19\u201324","DOI":"10.1145\/513400.513403"},{"key":"612_CR2","doi-asserted-by":"crossref","unstructured":"Brodsky, A., Durocher, S., Gethner, E.: Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics. Discrete Math. 262, 59\u201377 (2003)","DOI":"10.1016\/S0012-365X(02)00491-0"},{"key":"612_CR3","unstructured":"Guy, R.K.: The decline and fall of Zarankiewicz's theorem. In: Harary, F. (ed.), Proc. Proof Techniques in Graph Theory, New York, Academic Press, 1969, pp. 63\u201369"},{"key":"612_CR4","doi-asserted-by":"crossref","unstructured":"Goodman, J.E., Pollack, R.: Semispaces of configurations, cell complexes of arrangements in P2. J. Combin. Theory Ser. A 32, 1\u201319 (1982)","DOI":"10.1016\/0097-3165(82)90061-9"},{"key":"612_CR5","doi-asserted-by":"crossref","unstructured":"Goodman, J.E., Pollack, R.: A combinatorial version of the isotopy conjecture. In: Goodman, J.E., Lutwak, E., Malkevitch, J., Pollack R., (eds.), Discrete Geometry and Convexity, (Ann. New York Acad. Sci., vol. 440), 1985, pp. 12\u201319","DOI":"10.1111\/j.1749-6632.1985.tb14534.x"},{"key":"612_CR6","doi-asserted-by":"crossref","unstructured":"Jensen, H.F.: An upper bound for the rectilinear crossing number of the complete graph. J. Combin. Theory Ser B 10, 212\u2013216 (1971)","DOI":"10.1016\/0095-8956(71)90045-1"},{"key":"612_CR7","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Vesztergombi, K., Wagner, U., Welzl, E.: Convex quadrilaterals and k-sets. In: Pach, J. (ed.), Towards a theory of geometric graphs, (Contemporary Mathematics Series, vol. 342), AMS 2004, pp. 139\u2013148","DOI":"10.1090\/conm\/342\/06138"},{"key":"612_CR8","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. New York, N.Y.: Springer, 2002","DOI":"10.1007\/978-1-4613-0039-7"},{"key":"612_CR9","unstructured":"Mn\u00ebv, N.E.: On manifolds of combinatorial types of projective configurations and convex polyhedra. Soviet Math. Dokl. 32, 335\u2013337 (1985)"},{"key":"612_CR10","unstructured":"Pach, J., T\u00f3th, G.: Thirteen problems on crossing numbers. Geombinatorics 9, 194\u2013207 (2000)"},{"key":"612_CR11","unstructured":"Singer, D.: Rectilinear crossing numbers. Manuscript, 1971"},{"key":"612_CR12","unstructured":"Wagner, U.: On the rectilinear crossing number of complete graphs. In: Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA), 2003, pp. 583\u2013588"},{"key":"612_CR13","doi-asserted-by":"crossref","unstructured":"Zarankiewicz, K.: On a problem of P. Tur\u00e1n concerning graphs. Fund. Math. 41, 137\u2013145 (1954)","DOI":"10.4064\/fm-41-1-137-145"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0612-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-005-0612-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0612-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:25Z","timestamp":1559041105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-005-0612-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["612"],"URL":"https:\/\/doi.org\/10.1007\/s00373-005-0612-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}