{"has_accepted_license":"1","author":[{"full_name":"Hollom, Lawrence","first_name":"Lawrence","last_name":"Hollom"},{"first_name":"Lyuben","full_name":"Lichev, Lyuben","last_name":"Lichev","id":"9aa8388e-d003-11ee-8458-c4c1d7447977"},{"first_name":"Adva","full_name":"Mond, Adva","last_name":"Mond"},{"last_name":"Portier","first_name":"Julien","full_name":"Portier, Julien"},{"full_name":"Wang, Yiting","first_name":"Yiting","last_name":"Wang","id":"1917d194-076e-11ed-97cd-837255f88785"}],"license":"https://creativecommons.org/licenses/by/4.0/","date_created":"2026-09-27T22:01:52Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"09","fulldoi":"https://doi.org/10.1002/rsa.70095","quality_controlled":"1","supplementarymaterial":"yes","article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","publication":"Random Structures and Algorithms","language":[{"iso":"eng"}],"ddc":["500"],"article_type":"original","publication_status":"published","department":[{"_id":"MaKw"},{"_id":"GradSch"}],"day":"01","publisher":"Wiley","scopus_import":"1","acknowledgement":"Hollom was supported by the Internal Graduate Studentship of Trinity College, Cambridge. Mond was supported by UK Research and Innovation grant MR/W007320/2. Wang was supported by the ERC Starting Grant “RANDSTRUCT” No. 101076777. Lichev was supported by the Austrian Science Fund (FWF) [10.55776/ESP624]. For open access purposes, the authors have applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission. Open Access funding provided by Technische Universitat Wien.\r\n\r\nPart of this research was done during a visit of the fourth author to IST Austria. We thank IST Austria for its hospitality. We also thank the anonymous referees for their comments and suggestions. Open Access funding provided by Technische Universitat Wien. This work was supported by the European Research Council, UK Research and Innovation, the Austrian Science Fund, and Trinity College.","project":[{"grant_number":"101076777","name":"Randomness and structure in combinatorics","_id":"bd95085b-d553-11ed-ba76-e55d3349be45"}],"year":"2026","arxiv":1,"citation":{"ieee":"L. Hollom, L. Lichev, A. Mond, J. Portier, and Y. Wang, “Approximate Itai–Zehavi conjecture for random graphs,” <i>Random Structures and Algorithms</i>, vol. 69, no. 2. Wiley, 2026.","ista":"Hollom L, Lichev L, Mond A, Portier J, Wang Y. 2026. Approximate Itai–Zehavi conjecture for random graphs. Random Structures and Algorithms. 69(2), e70095.","apa":"Hollom, L., Lichev, L., Mond, A., Portier, J., &#38; Wang, Y. (2026). Approximate Itai–Zehavi conjecture for random graphs. <i>Random Structures and Algorithms</i>. Wiley. <a href=\"https://doi.org/10.1002/rsa.70095\">https://doi.org/10.1002/rsa.70095</a>","short":"L. Hollom, L. Lichev, A. Mond, J. Portier, Y. Wang, Random Structures and Algorithms 69 (2026).","chicago":"Hollom, Lawrence, Lyuben Lichev, Adva Mond, Julien Portier, and Yiting Wang. “Approximate Itai–Zehavi Conjecture for Random Graphs.” <i>Random Structures and Algorithms</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/rsa.70095\">https://doi.org/10.1002/rsa.70095</a>.","mla":"Hollom, Lawrence, et al. “Approximate Itai–Zehavi Conjecture for Random Graphs.” <i>Random Structures and Algorithms</i>, vol. 69, no. 2, e70095, Wiley, 2026, doi:<a href=\"https://doi.org/10.1002/rsa.70095\">10.1002/rsa.70095</a>.","ama":"Hollom L, Lichev L, Mond A, Portier J, Wang Y. Approximate Itai–Zehavi conjecture for random graphs. <i>Random Structures and Algorithms</i>. 2026;69(2). doi:<a href=\"https://doi.org/10.1002/rsa.70095\">10.1002/rsa.70095</a>"},"researchdata_availability":"no","PlanS_conform":"1","intvolume":"        69","das_tickbox":"0","file":[{"creator":"dernst","file_size":457581,"content_type":"application/pdf","relation":"main_file","date_updated":"2026-10-07T07:10:43Z","date_created":"2026-10-07T07:10:43Z","access_level":"open_access","checksum":"9a786460a47542f24576e947987e558a","file_name":"2026_RandomStructAlgorithms_Hollom.pdf","file_id":"23068","success":1}],"issue":"2","article_number":"e70095","volume":69,"status":"public","type":"journal_article","date_updated":"2026-10-07T07:13:30Z","_id":"23001","doi":"10.1002/rsa.70095","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_published":"2026-09-01T00:00:00Z","abstract":[{"text":"A famous conjecture by Itai and Zehavi states that, for every 𝑑\r\n-vertex-connected graph 𝐺\r\n and every vertex 𝑟\r\n in 𝐺\r\n, there are 𝑑\r\n spanning trees of 𝐺\r\n such that, for every vertex 𝑣\r\n in 𝐺 ∖{𝑟}\r\n, the paths between 𝑟\r\n and 𝑣\r\n in different trees are internally vertex-disjoint. We show that with high probability the Itai–Zehavi conjecture holds asymptotically for the Erdős–Rényi random graph 𝐺⁡(𝑛,𝑝)\r\n when 𝑛⁢𝑝 =𝜔⁡(log⁡𝑛)\r\n and for random regular graphs 𝐺⁡(𝑛,𝑑)\r\n when 𝑑 =𝜔⁡(log⁡𝑛)\r\n. Moreover, we essentially confirm the conjecture up to a constant factor for sparser random regular graphs. This answers a question of Draganić and Krivelevich positively. Our proof makes use of recent developments on sprinkling techniques in random regular graphs.","lang":"eng"}],"external_id":{"arxiv":["2506.23970"]},"file_date_updated":"2026-10-07T07:10:43Z","title":"Approximate Itai–Zehavi conjecture for random graphs","publication_identifier":{"issn":["1042-9832"],"eissn":["1098-2418"]},"oa":1,"OA_type":"hybrid","OA_place":"publisher"}