{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:25:51Z","timestamp":1648884351790},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T00:00:00Z","timestamp":1620518400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T00:00:00Z","timestamp":1620518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s00493-020-3989-0","type":"journal-article","created":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T13:02:20Z","timestamp":1620565340000},"page":"353-378","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Explicit Infinite Family of $$\\mathbb{M}$$-Vertex Graphs with Maximum Degree K and Diameter $$\\left[ {1 + o\\left( 1 \\right)} \\right]{\\log _{K - 1}\\mathbb{M}}$$ for Each K \u2212 1 a Prime Power"],"prefix":"10.1007","volume":"41","author":[{"given":"Michael","family":"Capalbo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,9]]},"reference":[{"key":"3989_CR1","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/0401033","volume":"1","author":"B Bollob\u00e1s","year":"1988","unstructured":"B. Bollob\u00e1s and F. R. K. Chung: The diameter of a cycle plus a random matching, SIAM J Discrete Math 1 (1988), 328\u2013333.","journal-title":"SIAM J Discrete Math"},{"key":"3989_CR2","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1137\/S0895480197330266","volume":"16","author":"M Capalbo","year":"2005","unstructured":"M. Capalbo: An Explicit Construction of Lower-Diameter Cubic Graphs, SIAM J. Discrete Math 16 (2005), 630\u2013634.","journal-title":"SIAM J. Discrete Math"},{"key":"3989_CR3","first-page":"1191","volume":"51","author":"M Capalbo","year":"2019","unstructured":"M. Capalbo: Explicit N-vertex graphs with maximum degree K and diameter[1+o(1)] logK\u22121N for each K\u22121 a prime power, STOC 51 (2019), 1191\u20131202.","journal-title":"STOC"},{"key":"3989_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF01285816","volume":"12","author":"P Chiu","year":"1992","unstructured":"P. Chiu: Cubic Ramanujan Graphs, Combinatorica 12 (1992), 275\u2013285.","journal-title":"Combinatorica"},{"key":"3989_CR5","series-title":"Congr. Numer.","first-page":"295","volume-title":"Eighteenth Southeastern Confrerence on Combinatorics, Graph Theory, and Computing","author":"F R K Chung","year":"1987","unstructured":"F. R. K. Chung: Diameter of graphs: Old Problems and New Results, Eighteenth Southeastern Confrerence on Combinatorics, Graph Theory, and Computing, Congr. Numer. 60, Utilas Math., Winnepeg, Manitoba (1987), 295\u2013317."},{"key":"3989_CR6","unstructured":"K. Conrad: Roots and Irreducibles, http:\/\/www.math.uconn.edu\/~kconrad\/blurbs\/galoistheory\/rootirred.pdf."},{"key":"3989_CR7","first-page":"398","volume":"32","author":"N Kahale","year":"1991","unstructured":"N. Kahale: Better Expansion for Ramanujan Graphs, FOCS 32 (1991), 398\u2013404.","journal-title":"FOCS"},{"key":"3989_CR8","volume-title":"Introduction To Parallel Algorithms and Architectures. Arrays, Trees, Hypercubes","author":"T Leighton","year":"1992","unstructured":"T. Leighton: Introduction To Parallel Algorithms and Architectures. Arrays, Trees, Hypercubes, Morgan Kauffmann, San Mateo, CA, 1992."},{"key":"3989_CR9","doi-asserted-by":"crossref","unstructured":"A. Lubotzky: Discrete Groups, Expanding Graphs, and Invariant Measures, Birkhauser Progress In Mathematics V. 125 (1994).","DOI":"10.1007\/978-3-0346-0332-4_10"},{"key":"3989_CR10","unstructured":"A. Lubotzky: Personal Communication."},{"key":"3989_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips and P. Sarnak: Ramanujan Graphs, Combinatorica 8 (1988), 261\u2013277.","journal-title":"Combinatorica"},{"key":"3989_CR12","unstructured":"G. A. Margulis: Explicit Group-Theoretical Constructions of Combinatorial Schemes And Their Applications to the Design of Expanders and Concentrators, Prob. Of Info. Trans. (1988), 39\u201346."},{"key":"3989_CR13","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M Morgenstern","year":"1994","unstructured":"M. Morgenstern: Existence And Explicit Construction of q+1 Regular Ramanujan Graphs For Every Prime Power q, J. Combinatorial Theory, Series B 62 (1994), 44\u201362.","journal-title":"J. Combinatorial Theory, Series B"},{"key":"3989_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00493-016-3403-0","volume":"38","author":"N Sardari","year":"2018","unstructured":"N. Sardari: Diameter Of Ramanujan Graphs And Random Cayley Graphs, Combinatorica 38 (2018), 1\u201320.","journal-title":"Combinatorica"},{"key":"3989_CR15","unstructured":"P. Sarnak: Personal Communication."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-3989-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-020-3989-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-3989-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T18:42:27Z","timestamp":1625683347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-020-3989-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["3989"],"URL":"https:\/\/doi.org\/10.1007\/s00493-020-3989-0","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,9]]},"assertion":[{"value":"10 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}