{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:53:33Z","timestamp":1743083613384,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":18,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461472537"},{"type":"electronic","value":"9781461472544"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4614-7254-4_2","type":"book-chapter","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T18:35:43Z","timestamp":1375382143000},"page":"15-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Neighborly Families of Boxes and Bipartite Coverings"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,18]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01788083","volume":"2","author":"N. Alon","year":"1986","unstructured":"N. Alon, Decomposition of the complete r-graph into complete r-partite r-graphs, Graphs and Combinatorics 2 (1986), 95\u2013100.","journal-title":"Graphs and Combinatorics"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"N. Alon, R. A. Brualdi and B. L. Shader, Multicolored forests in bipartite decompositions of graphs, J. Combinatorial Theory, Ser. B (1991), 143\u2013148.","DOI":"10.1016\/0095-8956(91)90059-S"},{"key":"2_CR3","first-page":"421","volume":"20","author":"N. G. de Bruijn","year":"1948","unstructured":"N. G. de Bruijn and P. Erd\u0151s, On a combinatorial problem, Indagationes Math. 20 (1948), 421\u2013423.","journal-title":"Indagationes Math."},{"key":"2_CR4","unstructured":"P. Erd\u0151s, On sequences of integers none of which divides the product of two others, and related problems, Mitteilungen des Forschungsinstituts f\u00fcr Mat. und Mech., Tomsk, 2 (1938), 74\u201382."},{"key":"2_CR5","unstructured":"P. Erd\u0151s and G. Purdy, Some extremal problems in combinatorial geometry, in: Handbook of Combinatorics (R. L. Graham, M. Gr\u00f6tschel and L. Lov\u00e1sz eds.), North Holland, to appear."},{"key":"2_CR6","unstructured":"A. Felzenbaum and M. A. Perles, Private communication."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0001-8708(78)90005-1","volume":"29","author":"R. L. Graham","year":"1978","unstructured":"R. L. Graham and L. Lov\u00e1sz, Distance matrix polynomials of trees, Advances in Math. 29 (1978), 60\u201388.","journal-title":"Advances in Math."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","volume":"50","author":"R. L. Graham","year":"1971","unstructured":"R. L. Graham and H. O. Pollak, On the addressing problem for loop switching, Bell Syst. Tech. J. 50 (1971), 2495\u20132519.","journal-title":"Bell Syst. Tech. J."},{"key":"2_CR9","volume-title":"On embedding graphs in squashed cubes, In: Lecture Notes in Mathematics 303, pp 99\u2013110","author":"R. L. Graham","year":"1973","unstructured":"R. L. Graham and H. O. Pollak, On embedding graphs in squashed cubes, In: Lecture Notes in Mathematics 303, pp 99\u2013110, Springer Verlag, New York-Berlin-Heidelberg, 1973."},{"key":"2_CR10","volume-title":"Neighborly families of boxes","author":"J. Kasem","year":"1985","unstructured":"J. Kasem, Neighborly families of boxes, Ph. D. Thesis, Hebrew University, Jerusalem, 1985"},{"key":"2_CR11","unstructured":"L. Lov\u00e1sz, Combinatorial Problems and Exercises, Problem 11.22, North Holland, Amsterdam 1979."},{"key":"2_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J. Pach","year":"1995","unstructured":"J. Pach and P. K. Agarwal, Combinatorial Geometry, John Wiley and Sons, Inc., New York, 1995."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0012-365X(84)90174-2","volume":"49","author":"G.W. Peck","year":"1984","unstructured":"G.W. Peck, A new proof of a theorem of Graham and Pollak, Discrete Math. 49 (1984), 327\u2013328.","journal-title":"Discrete Math."},{"key":"2_CR14","first-page":"253","volume":"20","author":"M. A. Perles","year":"1984","unstructured":"M. A. Perles, At most 2\n                  d\u2009+\u20091\n                neighborly simplices inE\n                \n                  d\n                , Annals of Discrete Math. 20 (1984), 253\u2013254.","journal-title":"Annals of Discrete Math."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00151512","volume":"8","author":"J. Zaks","year":"1979","unstructured":"J. Zaks, Bounds on neighborly families of convex polytopes, Geometriae Dedicata 8 (1979), 279\u2013296.","journal-title":"Geometriae Dedicata"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/BF00181209","volume":"11","author":"J. Zaks","year":"1981","unstructured":"J. Zaks, Neighborly families of 2\n                  d\n                \n                d-simplices inE\n                \n                  d\n                , Geometriae Dedicata 11 (1981), 505\u2013507.","journal-title":"Geometriae Dedicata"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"568","DOI":"10.2307\/2323163","volume":"92","author":"J. Zaks","year":"1985","unstructured":"J. Zaks, Amer. Math. Monthly 92 (1985), 568\u2013571.","journal-title":"Amer. Math. Monthly"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/jgt.3190060414","volume":"6","author":"H. Tverberg","year":"1982","unstructured":"H. Tverberg, On the decomposition ofK\n                \n                  n\n                \n                into complete bipartite graphs, J.\u00a0Graph Theory 6 (1982), 493\u2013494.","journal-title":"J. Graph Theory"}],"container-title":["The Mathematics of Paul Erd\u0151s II"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-7254-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T14:38:14Z","timestamp":1676817494000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4614-7254-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9781461472537","9781461472544"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-7254-4_2","relation":{},"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"18 May 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}