[{"issue":"4","volume":34,"OA_place":"publisher","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"article_type":"original","quality_controlled":"1","date_updated":"2025-09-30T11:26:00Z","author":[{"first_name":"Micha","last_name":"Christoph","full_name":"Christoph, Micha"},{"id":"554ff4e4-f325-11ee-b0c4-a10dbd523381","last_name":"Petrova","first_name":"Kalina H","full_name":"Petrova, Kalina H"},{"full_name":"Steiner, Raphael","first_name":"Raphael","last_name":"Steiner"}],"year":"2025","page":"559-564","ddc":["510"],"citation":{"ista":"Christoph M, Petrova KH, Steiner R. 2025. A note on digraph splitting. Combinatorics Probability and Computing. 34(4), 559–564.","short":"M. Christoph, K.H. Petrova, R. Steiner, Combinatorics Probability and Computing 34 (2025) 559–564.","chicago":"Christoph, Micha, Kalina H Petrova, and Raphael Steiner. “A Note on Digraph Splitting.” <i>Combinatorics Probability and Computing</i>. Cambridge University Press, 2025. <a href=\"https://doi.org/10.1017/S0963548325000045\">https://doi.org/10.1017/S0963548325000045</a>.","ieee":"M. Christoph, K. H. Petrova, and R. Steiner, “A note on digraph splitting,” <i>Combinatorics Probability and Computing</i>, vol. 34, no. 4. Cambridge University Press, pp. 559–564, 2025.","ama":"Christoph M, Petrova KH, Steiner R. A note on digraph splitting. <i>Combinatorics Probability and Computing</i>. 2025;34(4):559-564. doi:<a href=\"https://doi.org/10.1017/S0963548325000045\">10.1017/S0963548325000045</a>","apa":"Christoph, M., Petrova, K. H., &#38; Steiner, R. (2025). A note on digraph splitting. <i>Combinatorics Probability and Computing</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0963548325000045\">https://doi.org/10.1017/S0963548325000045</a>","mla":"Christoph, Micha, et al. “A Note on Digraph Splitting.” <i>Combinatorics Probability and Computing</i>, vol. 34, no. 4, Cambridge University Press, 2025, pp. 559–64, doi:<a href=\"https://doi.org/10.1017/S0963548325000045\">10.1017/S0963548325000045</a>."},"OA_type":"hybrid","publication":"Combinatorics Probability and Computing","status":"public","file":[{"creator":"dernst","file_name":"2025_CombProbComputing_Christoph.pdf","relation":"main_file","file_id":"20135","access_level":"open_access","date_updated":"2025-08-05T12:54:06Z","success":1,"date_created":"2025-08-05T12:54:06Z","content_type":"application/pdf","checksum":"98491e59b4f0d05d69f608bbd5706f1a","file_size":188818}],"publisher":"Cambridge University Press","scopus_import":"1","has_accepted_license":"1","ec_funded":1,"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","doi":"10.1017/S0963548325000045","date_created":"2025-04-06T22:01:32Z","article_processing_charge":"Yes (in subscription journal)","title":"A note on digraph splitting","department":[{"_id":"MaKw"}],"acknowledgement":"Funded by SNSF Ambizione grant No. 216071. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No, 101034413. Funded by SNSF grant CRSII5, 173721.","publication_identifier":{"issn":["0963-5483"],"eissn":["1469-2163"]},"external_id":{"arxiv":["2310.08449"],"isi":["001449245700001"]},"project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"}],"arxiv":1,"type":"journal_article","file_date_updated":"2025-08-05T12:54:06Z","month":"07","abstract":[{"lang":"eng","text":"A tantalizing open problem, posed independently by Stiebitz in 1995 and by Alon in 1996 and again in 2006, asks whether for every pair of integers  s,t≥1 there exists a finite number  F(s,t)\r\nsuch that the vertex set of every digraph of minimum out-degree at least  F(s,t) can be partitioned into non-empty parts  A  and  B  such that the subdigraphs induced on  A\r\n  and  B  have minimum out-degree at least  s  and  t , respectively.\r\nIn this short note, we prove that if  F(2,2)  exists, then all the numbers  F(s,t)  with  s,t≥1\r\n  exist and satisfy  F(s,t)=Θ(s+t) . In consequence, the problem of Alon and Stiebitz reduces to the case  s=t=2 . Moreover, the numbers  F(s,t)  with  s,t≥2  either all exist and grow linearly, or all of them do not exist."}],"date_published":"2025-07-01T00:00:00Z","isi":1,"_id":"19503","intvolume":"        34","publication_status":"published","language":[{"iso":"eng"}]},{"citation":{"chicago":"Krivelevich, Michael, Matthew Alan Kwan, and Benny Sudakov. “Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.” <i>Combinatorics, Probability and Computing</i>. Cambridge University Press, 2016. <a href=\"https://doi.org/10.1017/s0963548316000079\">https://doi.org/10.1017/s0963548316000079</a>.","short":"M. Krivelevich, M.A. Kwan, B. Sudakov, Combinatorics, Probability and Computing 25 (2016) 909–927.","ista":"Krivelevich M, Kwan MA, Sudakov B. 2016. Cycles and matchings in randomly perturbed digraphs and hypergraphs. Combinatorics, Probability and Computing. 25(6), 909–927.","ama":"Krivelevich M, Kwan MA, Sudakov B. Cycles and matchings in randomly perturbed digraphs and hypergraphs. <i>Combinatorics, Probability and Computing</i>. 2016;25(6):909-927. doi:<a href=\"https://doi.org/10.1017/s0963548316000079\">10.1017/s0963548316000079</a>","mla":"Krivelevich, Michael, et al. “Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.” <i>Combinatorics, Probability and Computing</i>, vol. 25, no. 6, Cambridge University Press, 2016, pp. 909–27, doi:<a href=\"https://doi.org/10.1017/s0963548316000079\">10.1017/s0963548316000079</a>.","apa":"Krivelevich, M., Kwan, M. A., &#38; Sudakov, B. (2016). Cycles and matchings in randomly perturbed digraphs and hypergraphs. <i>Combinatorics, Probability and Computing</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/s0963548316000079\">https://doi.org/10.1017/s0963548316000079</a>","ieee":"M. Krivelevich, M. A. Kwan, and B. Sudakov, “Cycles and matchings in randomly perturbed digraphs and hypergraphs,” <i>Combinatorics, Probability and Computing</i>, vol. 25, no. 6. Cambridge University Press, pp. 909–927, 2016."},"page":"909-927","publication":"Combinatorics, Probability and Computing","status":"public","scopus_import":"1","publisher":"Cambridge University Press","extern":"1","date_updated":"2023-02-23T14:02:07Z","year":"2016","author":[{"full_name":"Krivelevich, Michael","last_name":"Krivelevich","first_name":"Michael"},{"orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan","last_name":"Kwan"},{"first_name":"Benny","last_name":"Sudakov","full_name":"Sudakov, Benny"}],"oa":1,"quality_controlled":"1","article_type":"original","issue":"6","volume":25,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","day":"01","publication_status":"published","intvolume":"        25","language":[{"iso":"eng"}],"date_published":"2016-11-01T00:00:00Z","_id":"9591","publication_identifier":{"eissn":["1469-2163"],"issn":["0963-5483"]},"external_id":{"arxiv":["1501.04816"]},"abstract":[{"lang":"eng","text":"We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to a dense k-uniform hypergraph ensures the (asymptotically almost sure) existence of a perfect matching or a loose Hamilton cycle. The proof involves an interesting application of Szemerédi's Regularity Lemma, which might be independently useful. We next prove that digraphs with certain strong expansion properties are pancyclic, and use this to show that adding a linear number of random edges typically makes a dense digraph pancyclic. Finally, we prove that perturbing a certain (minimum-degree-dependent) number of random edges in a tournament typically ensures the existence of multiple edge-disjoint Hamilton cycles. All our results are tight."}],"arxiv":1,"month":"11","type":"journal_article","article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1501.04816","open_access":"1"}],"oa_version":"Preprint","date_created":"2021-06-22T12:35:13Z","doi":"10.1017/s0963548316000079","title":"Cycles and matchings in randomly perturbed digraphs and hypergraphs"}]