{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:05:24Z","timestamp":1787321124093,"version":"build-2736575974"},"reference-count":21,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["I3747"],"award-info":[{"award-number":["I3747"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["W1230"],"award-info":[{"award-number":["W1230"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["I3747"],"award-info":[{"award-number":["I3747"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["W1230"],"award-info":[{"award-number":["W1230"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["I3747"],"award-info":[{"award-number":["I3747"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["W1230"],"award-info":[{"award-number":["W1230"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["18-01472Y"],"award-info":[{"award-number":["18-01472Y"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["GA19-08740S"],"award-info":[{"award-number":["GA19-08740S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011326","name":"London School of Economics and Political Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100011326","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100013405","name":"Rijksdienst voor Ondernemend Nederland","doi-asserted-by":"publisher","award":["67985840"],"award-info":[{"award-number":["67985840"]}],"id":[{"id":"10.13039\/100013405","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100013405","name":"Rijksdienst voor Ondernemend Nederland","doi-asserted-by":"publisher","award":["6798580"],"award-info":[{"award-number":["6798580"]}],"id":[{"id":"10.13039\/100013405","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005777","name":"Stiftung zur F\u00f6rderung der Reinhold-W\u00fcrth-Hochschule der Hochschule Heilbronn","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005777","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P032125\/1"],"award-info":[{"award-number":["EP\/P032125\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Given integers $k,j$ with $1\\le j \\le k-1$, we consider the length of the longest $j$-tight path in the binomial random $k$-uniform hypergraph $H^k(n,p)$. We show that this length undergoes a phase transition from logarithmic length to linear and determine the critical threshold, as well as proving upper and lower bounds on the length in the subcritical and supercritical ranges. In particular, for the supercritical case we introduce the \\tt Pathfinder algorithm, a depth-first search algorithm which discovers $j$-tight paths in a $k$-uniform hypergraph. We prove that, in the supercritical case, with high probability this algorithm will find a long $j$-tight path.<\/jats:p>","DOI":"10.1137\/20m1345712","type":"journal-article","created":{"date-parts":[[2021,10,18]],"date-time":"2021-10-18T13:56:50Z","timestamp":1634565410000},"page":"2430-2458","source":"Crossref","is-referenced-by-count":1,"title":["Longest Paths in Random Hypergraphs"],"prefix":"10.1137","volume":"35","author":[{"given":"Oliver","family":"Cooley","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frederik","family":"Garbe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eng Keat","family":"Hng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mihyun","family":"Kang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicol\u00e1s","family":"Sanhueza-Matamala","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julian","family":"Zalla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2021,10,18]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579172"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2017.01.003"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2021.01.001"},{"key":"atypb4","unstructured":"O. Cooley,\n                      Paths, cycles and sprinkling in random hypergraphs\n                      , 2021,https:\/\/arxiv.org\/abs\/2103.16527."},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20761"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1017\/S096354831800010X"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"O. Cooley, M. Kang, and J. Zalla,\n                      Loose cores and cycles in random hypergraphs\n                      , 2021,https:\/\/arxiv.org\/abs\/2101.05008.","DOI":"10.1007\/978-3-030-83823-2_44"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.37236\/535"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20404"},{"key":"atypb10","first-page":"17","volume":"5","author":"Erd\u00f6s P.","year":"1960","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2016.05.012"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"S. Janson, T. \u0141uczak, and A. Ruci\u0144ski,\n                      Random Graphs\n                      , Wiley Ser. Discrete Math. Optim., Wiley-Interscience, New York, 2000,https:\/\/doi.org\/10.1002\/9781118032718.","DOI":"10.1002\/9781118032718"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/090766279"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20470"},{"key":"atypb15","first-page":"381","author":"K\u00fchn D.","year":"2014","journal-title":"Seoul"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020405"},{"key":"atypb17","first-page":"405","volume":"165","author":"Mubayi D.","year":"2020","journal-title":"Springer Optim. Appl."},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20919"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1988-0957061-X"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579445"},{"key":"atypb21","first-page":"145","author":"Zhao Y.","year":"2016","journal-title":"Switzerland"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/20M1345712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:06:23Z","timestamp":1787317583000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1345712"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1137\/20M1345712"],"URL":"https:\/\/doi.org\/10.1137\/20m1345712","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}