{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T06:21:08Z","timestamp":1775024468073,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T00:00:00Z","timestamp":1682985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T00:00:00Z","timestamp":1682985600000},"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":["Combinatorica"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00493-023-00033-8","type":"journal-article","created":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T15:03:33Z","timestamp":1683039813000},"page":"737-742","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Routing Permutations on Spectral Expanders via Matchings"],"prefix":"10.1007","volume":"43","author":[{"given":"Rajko","family":"Nenadov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,2]]},"reference":[{"issue":"6","key":"33_CR1","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1145\/235809.235812","volume":"43","author":"A Aggarwal","year":"1996","unstructured":"Aggarwal, A., Bar-Noy, A., Coppersmith, D., Ramaswami, R., Schieber, B., Sudan, M.: Efficient routing in optical networks. J. ACM 43(6), 973\u20131001 (1996)","journal-title":"J. ACM"},{"issue":"3","key":"33_CR2","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/S0895480192236628","volume":"7","author":"N Alon","year":"1994","unstructured":"Alon, N., Chung, F.R.K., Graham, R.L.: Routing permutations on graphs via matchings. SIAM J. Discret. Math. 7(3), 513\u2013530 (1994)","journal-title":"SIAM J. Discret. Math."},{"key":"33_CR3","unstructured":"Alon, N., Spencer, J.H.: The probabilistic method. In: Wiley-Interscience Series in Discrete Mathematics and Optimization, 4th edn. Wiley, Hoboken (2016)"},{"issue":"5","key":"33_CR4","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1137\/S0097539792232021","volume":"23","author":"AZ Broder","year":"1994","unstructured":"Broder, A.Z., Frieze, A.M., Upfal, E.: Existence and construction of edge-disjoint paths on expander graphs. SIAM J. Comput. 23(5), 976\u2013989 (1994)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"33_CR5","doi-asserted-by":"publisher","first-page":"5195","DOI":"10.1090\/tran\/8660","volume":"375","author":"N Dragani\u0107","year":"2022","unstructured":"Dragani\u0107, N., Krivelevich, M., Nenadov, R.: Rolling backwards can move you forward: on embedding problems in sparse expanders. Trans. Am. Math. Soc. 375(7), 5195\u20135216 (2022)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"33_CR6","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/0401018","volume":"1","author":"P Feldman","year":"1988","unstructured":"Feldman, P., Friedman, J., Pippenger, N.: Wide-sense nonblocking networks. SIAM J. Discret. Math. 1(2), 158\u2013173 (1988)","journal-title":"SIAM J. Discret. Math."},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02579202","volume":"7","author":"J Friedman","year":"1987","unstructured":"Friedman, J., Pippenger, N.: Expanding graphs contain all small trees. Combinatorica 7, 71\u201376 (1987)","journal-title":"Combinatorica"},{"key":"33_CR8","unstructured":"Glebov, R.: On Hamilton cycles and other spanning structures. PhD thesis, Freie Universit\u00e4t Berlin (2013)"},{"issue":"4","key":"33_CR9","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Widgerson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43(4), 439\u2013561 (2006)","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"33_CR10","first-page":"329","volume":"11","author":"P Horn","year":"2020","unstructured":"Horn, P., Purcilly, A.: Routing number of dense and expanding graphs. J. Comb. 11(2), 329\u2013350 (2020)","journal-title":"J. Comb."},{"key":"33_CR11","unstructured":"Johannsen, D.: Personal communication"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Krivelevich, M., Sudakov, B.: Pseudo-random graphs. In: More Sets, Graphs and Numbers. A Salute to Vera S\u00f3s and Andr\u00e1s Hajnal, pp. 199-262. Springer, J\u00e1nos Bolyai Mathematical Society, Berlin, Budapest (2006)","DOI":"10.1007\/978-3-540-32439-3_10"},{"issue":"2","key":"33_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"FT Leighton","year":"1994","unstructured":"Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-shop scheduling in $$O$$ (congestion + dilation) steps. Combinatorica 14(2), 167\u2013186 (1994)","journal-title":"Combinatorica"},{"key":"33_CR14","unstructured":"Letzter, S., Pokrovskiy, A., Yepremyan, L.: Size-Ramsey numbers of powers of hypergraph trees and long subdivisions. arXiv Preprint at arXiv:2103.01942 (2021)"},{"issue":"4","key":"33_CR15","doi-asserted-by":"publisher","first-page":"1482","DOI":"10.1137\/090776317","volume":"24","author":"W-T Li","year":"2010","unstructured":"Li, W.-T., Lu, L., Yang, Y.: Routing numbers of cycles, complete bipartite graphs, and hypercubes. SIAM J. Discret. Math. 24(4), 1482\u20131494 (2010)","journal-title":"SIAM J. Discret. Math."},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.jctb.2019.04.002","volume":"139","author":"R Montgomery","year":"2019","unstructured":"Montgomery, R.: Hamiltonicity in random graphs is born resilient. J. Comb. Theory Ser. B 139, 316\u2013341 (2019)","journal-title":"J. Comb. Theory Ser. B"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.aim.2019.106793","volume":"356","author":"R Montgomery","year":"2019","unstructured":"Montgomery, R.: Spanning trees in random graphs. Adv. Math. 356, 92 (2019)","journal-title":"Adv. Math."},{"issue":"1","key":"33_CR18","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480197323159","volume":"12","author":"L Zhang","year":"1999","unstructured":"Zhang, L.: Optimal bounds for matching routing on trees. SIAM J. Discret. Math. 12(1), 64\u201377 (1999)","journal-title":"SIAM J. Discret. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00033-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00033-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00033-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T16:06:12Z","timestamp":1692806772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00033-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,2]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["33"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00033-8","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,2]]},"assertion":[{"value":"9 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}