{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T15:49:07Z","timestamp":1775749747185,"version":"3.50.1"},"reference-count":21,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Asymptotic dimension and Assouad\u2013Nagata dimension are measures of the large-scale shape of a class of graphs. Bonamy, Bousquet, Esperet, Groenland, Liu, Pirot, and Scott [\n                    <jats:italic>J. Eur. Math. Society<\/jats:italic>\n                    ] showed that any proper minor-closed class has asymptotic dimension 2, dropping to 1 only if the treewidth is bounded. We improve this result by showing it also holds for the stricter Assouad\u2013Nagata dimension. We also characterise when subdivision-closed classes of graphs have bounded Assouad\u2013Nagata dimension.\n                  <\/jats:p>","DOI":"10.1017\/s0963548325100175","type":"journal-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T07:38:41Z","timestamp":1757403521000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":1,"title":["Proper minor-closed classes of graphs have Assouad\u2013Nagata dimension 2"],"prefix":"10.1017","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0122-1430","authenticated-orcid":false,"given":"Marc","family":"Distel","sequence":"first","affiliation":[{"name":"Monash University"}]}],"member":"56","published-online":{"date-parts":[[2025,9,9]]},"reference":[{"key":"S0963548325100175_ref13","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-10-10240-8"},{"key":"S0963548325100175_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2022.103631"},{"key":"S0963548325100175_ref3","volume-title":"Graph theory, volume 173 of Graduate Texts in Mathematics","author":"Diestel","year":"2018"},{"key":"S0963548325100175_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00042-X"},{"key":"S0963548325100175_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-023-2479-7"},{"key":"S0963548325100175_ref17","doi-asserted-by":"publisher","DOI":"10.4064\/fm-45-1-143-181"},{"key":"S0963548325100175_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"S0963548325100175_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2017.05.006"},{"key":"S0963548325100175_ref6","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-08-09149-1"},{"key":"S0963548325100175_ref8","doi-asserted-by":"publisher","DOI":"10.4171\/cmh\/549"},{"key":"S0963548325100175_ref15","doi-asserted-by":"publisher","DOI":"10.1155\/IMRN.2005.3625"},{"key":"S0963548325100175_ref16","doi-asserted-by":"publisher","DOI":"10.1112\/plms.70032"},{"key":"S0963548325100175_ref12","first-page":"1","volume-title":"Geometric group theory","volume":"2","author":"Gromov","year":"1993"},{"key":"S0963548325100175_ref9","doi-asserted-by":"publisher","DOI":"10.1090\/tran\/8487"},{"key":"S0963548325100175_ref11","first-page":"172","article-title":"Choice functions and Tychonoff\u2019s theorem","volume":"2","author":"Gottschalk","year":"1951","journal-title":"Proc. Amer. Math. Soc."},{"key":"S0963548325100175_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.topol.2008.02.011"},{"key":"S0963548325100175_ref2","doi-asserted-by":"publisher","DOI":"10.4171\/jems\/1341"},{"key":"S0963548325100175_ref14","first-page":"31","article-title":"Sur la distance de Nagata","volume":"294","author":"Assouad","year":"1982","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. I Math."},{"key":"S0963548325100175_ref18","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196715500095"},{"key":"S0963548325100175_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010020"},{"key":"S0963548325100175_ref10","doi-asserted-by":"publisher","DOI":"10.4171\/ggd\/31"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548325100175","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T08:49:20Z","timestamp":1768207760000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548325100175\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,9]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["S0963548325100175"],"URL":"https:\/\/doi.org\/10.1017\/s0963548325100175","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,9]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}