{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T17:38:38Z","timestamp":1702575518446},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T00:00:00Z","timestamp":1585872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T00:00:00Z","timestamp":1585872000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00373-020-02163-y","type":"journal-article","created":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T22:02:30Z","timestamp":1585951350000},"page":"905-911","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Rectilinear Crossings in Complete Balanced d-Partite d-Uniform Hypergraphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Rahul","family":"Gangopadhyay","sequence":"first","affiliation":[]},{"given":"Saswata","family":"Shannigrahi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,3]]},"reference":[{"key":"2163_CR1","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/s00454-012-9403-y","volume":"48","author":"BM \u00c1brego","year":"2012","unstructured":"\u00c1brego, B.M., Cetina, M., Fern\u00e1ndez-Merchant, S., Lea\u00f1os, J., Salazar, G.: On $(\\le k)$-edges, crossings, and halving lines of geometric drawings of $K_n$. Discrete Comput. Geom. 48, 192\u2013215 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"2163_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dam.2015.10.009","volume":"209","author":"A Anshu","year":"2016","unstructured":"Anshu, A., Shannigrahi, S.: A lower bound on the crossing number of uniform hypergraphs. Discrete Appl. Math. 209, 11\u201315 (2016)","journal-title":"Discrete Appl. Math."},{"key":"2163_CR3","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.comgeo.2016.11.001","volume":"61","author":"A Anshu","year":"2017","unstructured":"Anshu, A., Gangopadhyay, R., Shannigrahi, S., Vusirikala, S.: On the rectilinear crossing number of complete uniform hypergraphs. Comput. Geom. Theory Appl. 61, 38\u201347 (2017)","journal-title":"Comput. Geom. Theory Appl."},{"key":"2163_CR4","unstructured":"Dey, T. K., Pach, J.: Extremal problems for geometric hypergraphs. In: Proc. ISAAC \u201996, Lecture Notes in Computer Science, vol. 1178, pp. 105\u2013114 (1996) (Discrete Comput. Geom. 19, 473\u2013484 (1998))"},{"key":"2163_CR5","first-page":"255","volume":"38","author":"D Gale","year":"1956","unstructured":"Gale, D.: Neighboring vertices on a convex polyhedron. Linear Inequal. Relat. Syst. 38, 255\u2013263 (1956)","journal-title":"Linear Inequal. Relat. Syst."},{"key":"2163_CR6","doi-asserted-by":"publisher","first-page":"101578","DOI":"10.1016\/j.comgeo.2019.101578","volume":"86","author":"R Gangopadhyay","year":"2020","unstructured":"Gangopadhyay, R., Shannigrahi, S.: $k$-Sets and rectilinear crossings in complete uniform hypergraphs. Comput. Geom. Theory Appl. 86, 101578 (2020)","journal-title":"Comput. Geom. Theory Appl."},{"key":"2163_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0019-9","volume-title":"Convex Polytopes","author":"B Gr\u00fcnbaum","year":"2003","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes. Springer, Berlin (2003)"},{"key":"2163_CR8","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/0095-8956(71)90045-1","volume":"10","author":"HF Jensen","year":"1971","unstructured":"Jensen, H.F.: An upper bound for the rectilinear crossing number of the complete graph. J. Comb. Theory Ser. B 10, 212\u2013216 (1971)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2163_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0021-9800(70)80087-4","volume":"9","author":"DJ Kleitman","year":"1970","unstructured":"Kleitman, D.J.: The crossing number of $K_{5, n}$. J. Comb. Theory 9, 315\u2013323 (1970)","journal-title":"J. Comb. Theory"},{"issue":"1","key":"2163_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1137\/S0895480104442741","volume":"20","author":"ED Klerk","year":"2006","unstructured":"Klerk, E.D., Maharry, J., Pasechnik, D.V., Richter, R.B., Salazar, G.: Improved bounds for the crossing numbers of $K_{m, n}$ and $K_n$. SIAM J. Discrete Math. 20(1), 189\u2013202 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"2163_CR11","volume-title":"Using the Borsuk\u2013Ulam Theorem","author":"J Matou\u0161ek","year":"2003","unstructured":"Matou\u0161ek, J.: Using the Borsuk\u2013Ulam Theorem. Springer, Berlin (2003)"},{"key":"2163_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719512","volume-title":"Matrix Analysis and Applied Linear Algebra","author":"CD Meyer","year":"2000","unstructured":"Meyer, C.D.: Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia (2000)"},{"key":"2163_CR13","doi-asserted-by":"publisher","first-page":"N8","DOI":"10.37236\/1748","volume":"10","author":"NH Nahas","year":"2003","unstructured":"Nahas, N.H.: On the crossing number of $K_ {m, n}$. Electron. J. Comb. 10, N8 (2003)","journal-title":"Electron. J. Comb."},{"key":"2163_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/00029890.1997.11990611","volume":"104","author":"RB Richter","year":"1997","unstructured":"Richter, R.B., Thomassen, C.: Relations between crossing numbers of complete and complete bipartite graphs. Am. Math. Mon. 104, 131\u2013137 (1997)","journal-title":"Am. Math. Mon."},{"key":"2163_CR15","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1215\/S0012-7094-42-00925-6","volume":"9","author":"AH Stone","year":"1942","unstructured":"Stone, A.H., Tukey, J.W.: Generalized \u201csandwich\u201d theorems. Duke Math. J. 9, 356\u2013359 (1942)","journal-title":"Duke Math. J."},{"key":"2163_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1090\/conm\/178\/01908","volume":"178","author":"S Vre\u0107ica","year":"1994","unstructured":"Vre\u0107ica, S., \u017divaljevi\u0107, R.: New cases of the colored Tverberg\u2019s theorem. Contemp. Math. 178, 325\u2013334 (1994)","journal-title":"Contemp. Math."},{"key":"2163_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.4064\/fm-41-1-137-145","volume":"41","author":"K Zarankiewicz","year":"1955","unstructured":"Zarankiewicz, K.: On a problem of P. Turan concerning graphs. Fundam. Math. 41, 137\u2013145 (1955)","journal-title":"Fundam. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02163-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02163-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02163-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T23:17:58Z","timestamp":1617405478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02163-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["2163"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02163-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,3]]},"assertion":[{"value":"14 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}