{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T00:18:28Z","timestamp":1703117908153},"reference-count":33,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T00:00:00Z","timestamp":1697760000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that for every <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000342_inline1.png\" \/><jats:tex-math>\n$n\\in \\mathbb N$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000342_inline2.png\" \/><jats:tex-math>\n$\\log n\\le d\\lt n$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, if a graph <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000342_inline3.png\" \/><jats:tex-math>\n$G$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> has <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000342_inline4.png\" \/><jats:tex-math>\n$N=\\Theta (dn)$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> vertices and minimum degree <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000342_inline5.png\" \/><jats:tex-math>\n$(1+o(1))\\frac{N}{2}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, then it contains a spanning subdivision of every <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000342_inline6.png\" \/><jats:tex-math>\n$n$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-vertex <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000342_inline7.png\" \/><jats:tex-math>\n$d$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-regular graph.<\/jats:p>","DOI":"10.1017\/s0963548323000342","type":"journal-article","created":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T10:50:15Z","timestamp":1697799015000},"page":"121-128","update-policy":"http:\/\/dx.doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Spanning subdivisions in Dirac graphs"],"prefix":"10.1017","volume":"33","author":[{"given":"Mat\u00edas","family":"Pavez-Sign\u00e9","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2023,10,20]]},"reference":[{"key":"S0963548323000342_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01364272"},{"key":"S0963548323000342_ref25","article-title":"A solution to Erd\u0151s and Hajnal\u2019s odd cycle problem","volume":"36","author":"Liu","year":"2023","journal-title":"J. Am. Math. Soc."},{"key":"S0963548323000342_ref18","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199811)29:3<167::AID-JGT4>3.0.CO;2-O"},{"key":"S0963548323000342_ref15","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548398003502"},{"key":"S0963548323000342_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02020444"},{"key":"S0963548323000342_ref7","first-page":"143","article-title":"On complete topological subgraphs of certain graphs","volume":"7","author":"Erd\u0151s","year":"1964","journal-title":"Ann. Univ. Sci. Budapest Sect. Math."},{"key":"S0963548323000342_ref13","volume-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"Janson","year":"2000"},{"key":"S0963548323000342_ref12","unstructured":"[12] Hurley, E. , Joos, F. and Lang, R. (2022) Sufficient conditions for perfect mixed tilings. arXiv preprint arXiv: 2201.03944."},{"key":"S0963548323000342_ref23","doi-asserted-by":"publisher","DOI":"10.5817\/CZ.MUNI.EUROCOMB23-098"},{"key":"S0963548323000342_ref26","first-page":"1","article-title":"Balanced subdivisions of cliques in graphs","author":"Luan","year":"in press","journal-title":"Combinatorica"},{"key":"S0963548323000342_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001620"},{"key":"S0963548323000342_ref30","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10091"},{"key":"S0963548323000342_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-59204-5_14"},{"key":"S0963548323000342_ref10","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20344"},{"key":"S0963548323000342_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2022.04.007"},{"key":"S0963548323000342_ref5","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.69"},{"key":"S0963548323000342_ref3","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1997.0188"},{"key":"S0963548323000342_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548303005741"},{"key":"S0963548323000342_ref29","first-page":"201","volume-title":"London Math. Soc. Lecture Note Ser. (Proc. British Combinatorial Conf., Univ. Coll. Wales, Aberystwyth, 1973)","volume":"13","author":"Seymour","year":"1974"},{"key":"S0963548323000342_ref33","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548301004904"},{"key":"S0963548323000342_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-009-2254-3"},{"key":"S0963548323000342_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00208-008-0268-6"},{"key":"S0963548323000342_ref11","first-page":"601","volume-title":"Combinatorial Theory and its Applications, II (Proc. Colloq., Balatonf\u00fcred, 1969)","author":"Hajnal","year":"1970"},{"key":"S0963548323000342_ref6","first-page":"1","volume-title":"Graph Theory and Combinatorics, (Cambridge, 1983)","author":"Erd\u0151s","year":"1984"},{"key":"S0963548323000342_ref16","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s004930070020","article-title":"Tiling tur\u00e1n theorems","volume":"20","author":"Koml\u00f3s","year":"2000","journal-title":"Combinatorica"},{"key":"S0963548323000342_ref28","first-page":"70","article-title":"Hamilton connected graphs","volume":"42","author":"Ore","year":"1963","journal-title":"J. Math. Pures Appl."},{"key":"S0963548323000342_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2023.03.002"},{"key":"S0963548323000342_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01626028"},{"key":"S0963548323000342_ref24","unstructured":"[24] Lee, H. (2023) Spanning subdivisions in dense digraphs. arXiv preprint arXiv: 2306.06627."},{"key":"S0963548323000342_ref32","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080103"},{"key":"S0963548323000342_ref20","doi-asserted-by":"publisher","DOI":"10.1017\/S096354830000184X"},{"key":"S0963548323000342_ref2","doi-asserted-by":"publisher","DOI":"10.1201\/b16132-57"},{"key":"S0963548323000342_ref21","volume-title":"London Mathematical Society","volume":"365","author":"K\u00fchn","year":"2009"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548323000342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T09:49:17Z","timestamp":1703065757000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548323000342\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,20]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["S0963548323000342"],"URL":"https:\/\/doi.org\/10.1017\/s0963548323000342","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,20]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}