{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:49:45Z","timestamp":1649119785003},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2012,3,16]],"date-time":"2012-03-16T00:00:00Z","timestamp":1331856000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2012,5]]},"abstract":"<jats:p>We define a variant of the crossing number for an embedding of a graph<jats:italic>G<\/jats:italic>into \u211d<jats:sup>3<\/jats:sup>, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on the rectilinear space crossing numbers of pseudo-random graphs.<\/jats:p>","DOI":"10.1017\/s096354831100040x","type":"journal-article","created":{"date-parts":[[2012,3,16]],"date-time":"2012-03-16T10:36:49Z","timestamp":1331894209000},"page":"358-373","source":"Crossref","is-referenced-by-count":3,"title":["Space Crossing Numbers"],"prefix":"10.1017","volume":"21","author":[{"given":"BORIS","family":"BUKH","sequence":"first","affiliation":[]},{"given":"ALFREDO","family":"HUBARD","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2012,3,16]]},"reference":[{"key":"S096354831100040X_ref2","first-page":"9","volume-title":"Theory and Practice of Combinatorics","author":"Ajtai","year":"1982"},{"key":"S096354831100040X_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009350"},{"key":"S096354831100040X_ref21","first-page":"405","article-title":"The crossing number of a cubic plane polyhedral map plus an edge","volume":"31","author":"Riskin","year":"1996","journal-title":"Studia Sci. Math. Hungar."},{"key":"S096354831100040X_ref12","unstructured":"[12] Fox J. , Gromov M. , Lafforgue V. , Naor A. and Pach J. (2010) Overlap properties of geometric expanders. J. Reine Angew. Math., to appear. arXiv:1005.1392"},{"key":"S096354831100040X_ref25","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22163"},{"key":"S096354831100040X_ref1","first-page":"1","volume-title":"Mathematical Foundations of Computer Science: Prague 1992","author":"Agarwal","year":"1992"},{"key":"S096354831100040X_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215922"},{"key":"S096354831100040X_ref4","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"Basu","year":"2006"},{"key":"S096354831100040X_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122555"},{"key":"S096354831100040X_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01876314"},{"key":"S096354831100040X_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009354"},{"key":"S096354831100040X_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-1355-2"},{"key":"S096354831100040X_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02086610"},{"key":"S096354831100040X_ref24","doi-asserted-by":"publisher","DOI":"10.1142\/S0218216509007221"},{"key":"S096354831100040X_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32439-3_10"},{"key":"S096354831100040X_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744433"},{"key":"S096354831100040X_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-011-0029-1"},{"key":"S096354831100040X_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0071633"},{"key":"S096354831100040X_ref18","unstructured":"[18] Nivasch G. (2009) Weak epsilon-nets, Davenport\u2013Schinzel sequences, and related problems. PhD thesis, Tel Aviv University. people.inf.ethz.ch\/gnivasch\/publications\/papers\/phd_thesis.pdf"},{"key":"S096354831100040X_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00013-009-3013-9"},{"key":"S096354831100040X_ref23","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548397002976"},{"key":"S096354831100040X_ref9","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190070410"},{"key":"S096354831100040X_ref11","volume-title":"Graph Theory","author":"Diestel","year":"2005"},{"key":"S096354831100040X_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF02810677"},{"key":"S096354831100040X_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6848-0"},{"key":"S096354831100040X_ref5","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190170308"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S096354831100040X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T10:17:35Z","timestamp":1561457855000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S096354831100040X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,16]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["S096354831100040X"],"URL":"https:\/\/doi.org\/10.1017\/s096354831100040x","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,16]]}}}