[{"DOAJ_listed":"1","acknowledgement":"We thank the anonymous referees for many helpful comments on an earlier version of this\r\narticle. Kalina Petrova was supported by grant no. CRSII5 173721 of the Swiss National\r\nScience Foundation, and by the European Union’s Horizon 2020 research and innovation\r\nprogramme under the Marie Sk lodowska-Curie grant agreement No. 101034413","type":"journal_article","day":"08","status":"public","has_accepted_license":"1","date_created":"2026-05-17T22:02:11Z","arxiv":1,"doi":"10.37236/13316","ddc":["510"],"corr_author":"1","scopus_import":"1","publication_identifier":{"eissn":["1077-8926"]},"OA_type":"gold","issue":"2","title":"Randomly perturbed digraphs also have bounded-degree spanning trees","language":[{"iso":"eng"}],"publisher":"Electronic Journal of Combinatorics","OA_place":"publisher","license":"https://creativecommons.org/licenses/by-nd/4.0/","month":"05","publication":"Electronic Journal of Combinatorics","article_processing_charge":"Yes","quality_controlled":"1","date_published":"2026-05-08T00:00:00Z","citation":{"apa":"Morawski, P., &#38; Petrova, K. H. (2026). Randomly perturbed digraphs also have bounded-degree spanning trees. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/13316\">https://doi.org/10.37236/13316</a>","ista":"Morawski P, Petrova KH. 2026. Randomly perturbed digraphs also have bounded-degree spanning trees. Electronic Journal of Combinatorics. 33(2), P2.24.","short":"P. Morawski, K.H. Petrova, Electronic Journal of Combinatorics 33 (2026).","ama":"Morawski P, Petrova KH. Randomly perturbed digraphs also have bounded-degree spanning trees. <i>Electronic Journal of Combinatorics</i>. 2026;33(2). doi:<a href=\"https://doi.org/10.37236/13316\">10.37236/13316</a>","chicago":"Morawski, Patryk, and Kalina H Petrova. “Randomly Perturbed Digraphs Also Have Bounded-Degree Spanning Trees.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2026. <a href=\"https://doi.org/10.37236/13316\">https://doi.org/10.37236/13316</a>.","ieee":"P. Morawski and K. H. Petrova, “Randomly perturbed digraphs also have bounded-degree spanning trees,” <i>Electronic Journal of Combinatorics</i>, vol. 33, no. 2. Electronic Journal of Combinatorics, 2026.","mla":"Morawski, Patryk, and Kalina H. Petrova. “Randomly Perturbed Digraphs Also Have Bounded-Degree Spanning Trees.” <i>Electronic Journal of Combinatorics</i>, vol. 33, no. 2, P2.24, Electronic Journal of Combinatorics, 2026, doi:<a href=\"https://doi.org/10.37236/13316\">10.37236/13316</a>."},"intvolume":"        33","article_number":"P2.24","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"volume":33,"year":"2026","publication_status":"published","file":[{"file_size":399969,"date_updated":"2026-05-18T08:46:26Z","relation":"main_file","content_type":"application/pdf","file_id":"21893","file_name":"2026_ElectrJournCombinatorics_Morawski.pdf","success":1,"creator":"dernst","checksum":"9e8402cb2e8870ba7ded9ae7b308201a","date_created":"2026-05-18T08:46:26Z","access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2026-05-18T08:46:26Z","date_updated":"2026-05-18T08:50:18Z","department":[{"_id":"MaKw"}],"author":[{"full_name":"Morawski, Patryk","last_name":"Morawski","first_name":"Patryk"},{"id":"554ff4e4-f325-11ee-b0c4-a10dbd523381","full_name":"Petrova, Kalina H","last_name":"Petrova","first_name":"Kalina H"}],"external_id":{"arxiv":["2306.14648"]},"abstract":[{"text":"We show that a randomly perturbed digraph, where we start with a dense digraph Dα and add a small number of random edges to it, will typically contain a fixed orientation of a bounded-degree spanning tree. This answers a question posed by Araujo, Balogh, Krueger, Piga and Treglown and generalizes the corresponding result for randomly perturbed graphs by Krivelevich, Kwan and Sudakov. More specifically, we prove that there exists a constant c=c(α,Δ) such that if \r\nT is an oriented tree with maximum degree Δ and Dα is an n-vertex digraph with minimum semidegree αn, then the graph obtained by adding cn uniformly random edges to Dα will contain T with high probability.","lang":"eng"}],"article_type":"original","oa":1,"ec_funded":1,"_id":"21884","project":[{"grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program"}],"oa_version":"Published Version"},{"date_published":"2023-05-05T00:00:00Z","citation":{"chicago":"Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2023. <a href=\"https://doi.org/10.37236/11471\">https://doi.org/10.37236/11471</a>.","ieee":"M. Anastos, “A note on long cycles in sparse random graphs,” <i>Electronic Journal of Combinatorics</i>, vol. 30, no. 2. Electronic Journal of Combinatorics, 2023.","ama":"Anastos M. A note on long cycles in sparse random graphs. <i>Electronic Journal of Combinatorics</i>. 2023;30(2). doi:<a href=\"https://doi.org/10.37236/11471\">10.37236/11471</a>","mla":"Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.” <i>Electronic Journal of Combinatorics</i>, vol. 30, no. 2, P2.21, Electronic Journal of Combinatorics, 2023, doi:<a href=\"https://doi.org/10.37236/11471\">10.37236/11471</a>.","ista":"Anastos M. 2023. A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. 30(2), P2.21.","apa":"Anastos, M. (2023). A note on long cycles in sparse random graphs. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/11471\">https://doi.org/10.37236/11471</a>","short":"M. Anastos, Electronic Journal of Combinatorics 30 (2023)."},"intvolume":"        30","article_number":"P2.21","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"language":[{"iso":"eng"}],"publisher":"Electronic Journal of Combinatorics","month":"05","publication":"Electronic Journal of Combinatorics","article_processing_charge":"No","quality_controlled":"1","ddc":["510"],"corr_author":"1","publication_identifier":{"eissn":["1077-8926"]},"scopus_import":"1","issue":"2","title":"A note on long cycles in sparse random graphs","acknowledgement":"We would like to thank the reviewers for their helpful comments and remarks.","day":"05","type":"journal_article","has_accepted_license":"1","status":"public","arxiv":1,"doi":"10.37236/11471","date_created":"2023-05-21T22:01:05Z","article_type":"original","oa":1,"_id":"13042","oa_version":"Published Version","department":[{"_id":"MaKw"}],"author":[{"full_name":"Anastos, Michael","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","first_name":"Michael","last_name":"Anastos"}],"external_id":{"arxiv":["2105.13828"],"isi":["000988285500001"]},"abstract":[{"lang":"eng","text":"Let Lc,n denote the size of the longest cycle in G(n, c/n),c >1 constant.  We show that there exists a continuous function f(c) such that Lc,n/n→f(c) a.s.  for c>20,  thus  extending  a  result  of  Frieze  and  the  author  to  smaller  values  of c. Thereafter,  for c>20,  we  determine  the  limit  of  the  probability  that G(n, c/n)contains  cycles  of  every  length  between  the  length  of  its  shortest  and  its  longest cycles as n→∞."}],"file_date_updated":"2023-05-22T07:43:19Z","date_updated":"2024-10-09T21:05:26Z","year":"2023","volume":30,"publication_status":"published","file":[{"access_level":"open_access","creator":"dernst","success":1,"date_created":"2023-05-22T07:43:19Z","checksum":"6269ed3b3eded6536d3d9d6baad2d5b9","file_name":"2023_JourCombinatorics_Anastos.pdf","file_size":448736,"date_updated":"2023-05-22T07:43:19Z","file_id":"13046","content_type":"application/pdf","relation":"main_file"}],"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"year":"2023","volume":30,"publication_status":"published","file":[{"access_level":"open_access","success":1,"creator":"dernst","checksum":"52c46c8cb329f9aaee9ade01525f317b","date_created":"2023-09-15T08:02:09Z","file_name":"2023_elecJournCombinatorics_Anastos.pdf","date_updated":"2023-09-15T08:02:09Z","file_size":247917,"relation":"main_file","file_id":"14338","content_type":"application/pdf"}],"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2023-09-15T08:02:09Z","date_updated":"2025-09-09T12:54:51Z","department":[{"_id":"MaKw"}],"external_id":{"isi":["001042382200001"],"arxiv":["2212.03100"]},"author":[{"first_name":"Michael","last_name":"Anastos","full_name":"Anastos, Michael","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb"},{"full_name":"Fabian, David","last_name":"Fabian","first_name":"David"},{"full_name":"Müyesser, Alp","first_name":"Alp","last_name":"Müyesser"},{"full_name":"Szabó, Tibor","last_name":"Szabó","first_name":"Tibor"}],"abstract":[{"lang":"eng","text":"We study multigraphs whose edge-sets are the union of three perfect matchings, M1, M2, and M3. Given such a graph G and any a1; a2; a3 2 N with a1 +a2 +a3 6 n - 2, we show there exists a matching M of G with jM \\ Mij = ai for each i 2 f1; 2; 3g. The bound n - 2 in the theorem is best possible in general. We conjecture however that if G is bipartite, the same result holds with n - 2 replaced by n - 1. We give a construction that shows such a result would be tight. We\r\nalso make a conjecture generalising the Ryser-Brualdi-Stein conjecture with colour\r\nmultiplicities."}],"article_type":"original","oa":1,"_id":"14319","ec_funded":1,"project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"oa_version":"Published Version","acknowledgement":"Anastos has received funding from the European Union’s Horizon 2020 research and in-novation programme under the Marie Sk lodowska-Curie grant agreement No 101034413.Fabian’s research is supported by the Deutsche Forschungsgemeinschaft (DFG, GermanResearch Foundation) Graduiertenkolleg “Facets of Complexity” (GRK 2434).","day":"28","type":"journal_article","has_accepted_license":"1","status":"public","doi":"10.37236/11714","date_created":"2023-09-10T22:01:12Z","arxiv":1,"scopus_import":"1","publication_identifier":{"eissn":["1077-8926"]},"ddc":["510"],"issue":"3","title":"Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets","publisher":"Electronic Journal of Combinatorics","language":[{"iso":"eng"}],"month":"07","publication":"Electronic Journal of Combinatorics","quality_controlled":"1","article_processing_charge":"Yes","citation":{"mla":"Anastos, Michael, et al. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” <i>Electronic Journal of Combinatorics</i>, vol. 30, no. 3, P3.10, Electronic Journal of Combinatorics, 2023, doi:<a href=\"https://doi.org/10.37236/11714\">10.37236/11714</a>.","ama":"Anastos M, Fabian D, Müyesser A, Szabó T. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. <i>Electronic Journal of Combinatorics</i>. 2023;30(3). doi:<a href=\"https://doi.org/10.37236/11714\">10.37236/11714</a>","chicago":"Anastos, Michael, David Fabian, Alp Müyesser, and Tibor Szabó. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2023. <a href=\"https://doi.org/10.37236/11714\">https://doi.org/10.37236/11714</a>.","ieee":"M. Anastos, D. Fabian, A. Müyesser, and T. Szabó, “Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets,” <i>Electronic Journal of Combinatorics</i>, vol. 30, no. 3. Electronic Journal of Combinatorics, 2023.","short":"M. Anastos, D. Fabian, A. Müyesser, T. Szabó, Electronic Journal of Combinatorics 30 (2023).","ista":"Anastos M, Fabian D, Müyesser A, Szabó T. 2023. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. 30(3), P3.10.","apa":"Anastos, M., Fabian, D., Müyesser, A., &#38; Szabó, T. (2023). Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/11714\">https://doi.org/10.37236/11714</a>"},"date_published":"2023-07-28T00:00:00Z","intvolume":"        30","article_number":"P3.10","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"}},{"department":[{"_id":"MaKw"}],"author":[{"full_name":"Cooley, Oliver","id":"43f4ddd0-a46b-11ec-8df6-ef3703bd721d","first_name":"Oliver","last_name":"Cooley"},{"first_name":"Nicola","last_name":"Del Giudice","full_name":"Del Giudice, Nicola"},{"full_name":"Kang, Mihyun","last_name":"Kang","first_name":"Mihyun"},{"last_name":"Sprüssel","first_name":"Philipp","full_name":"Sprüssel, Philipp"}],"external_id":{"arxiv":["2005.07103"],"isi":["000836200300001"]},"abstract":[{"lang":"eng","text":"We consider a generalised model of a random simplicial complex, which arises from a random hypergraph. Our model is generated by taking the downward-closure of a non-uniform binomial random hypergraph, in which for each k, each set of k+1 vertices forms an edge with some probability pk independently. As a special case, this contains an extensively studied model of a (uniform) random simplicial complex, introduced by Meshulam and Wallach [Random Structures & Algorithms 34 (2009), no. 3, pp. 408–417].\r\nWe consider a higher-dimensional notion of connectedness on this new model according to the vanishing of cohomology groups over an arbitrary abelian group R. We prove that this notion of connectedness displays a phase transition and determine the threshold. We also prove a hitting time result for a natural process interpretation, in which simplices and their downward-closure are added one by one. In addition, we determine the asymptotic behaviour of cohomology groups inside the critical window around the time of the phase transition."}],"article_type":"original","oa":1,"_id":"11740","oa_version":"Published Version","year":"2022","volume":29,"publication_status":"published","file":[{"content_type":"application/pdf","file_id":"11742","relation":"main_file","date_updated":"2022-08-08T06:28:52Z","file_size":1768663,"file_name":"2022_ElecJournCombinatorics_Cooley.pdf","date_created":"2022-08-08T06:28:52Z","checksum":"057c676dcee70236aa234d4ce6138c69","creator":"dernst","success":1,"access_level":"open_access"}],"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file_date_updated":"2022-08-08T06:28:52Z","date_updated":"2024-10-09T21:03:03Z","language":[{"iso":"eng"}],"publisher":"Electronic Journal of Combinatorics","month":"07","publication":"Electronic Journal of Combinatorics","article_processing_charge":"No","quality_controlled":"1","date_published":"2022-07-29T00:00:00Z","citation":{"short":"O. Cooley, N. Del Giudice, M. Kang, P. Sprüssel, Electronic Journal of Combinatorics 29 (2022).","apa":"Cooley, O., Del Giudice, N., Kang, M., &#38; Sprüssel, P. (2022). Phase transition in cohomology groups of non-uniform random simplicial complexes. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/10607\">https://doi.org/10.37236/10607</a>","ista":"Cooley O, Del Giudice N, Kang M, Sprüssel P. 2022. Phase transition in cohomology groups of non-uniform random simplicial complexes. Electronic Journal of Combinatorics. 29(3), P3.27.","mla":"Cooley, Oliver, et al. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” <i>Electronic Journal of Combinatorics</i>, vol. 29, no. 3, P3.27, Electronic Journal of Combinatorics, 2022, doi:<a href=\"https://doi.org/10.37236/10607\">10.37236/10607</a>.","ieee":"O. Cooley, N. Del Giudice, M. Kang, and P. Sprüssel, “Phase transition in cohomology groups of non-uniform random simplicial complexes,” <i>Electronic Journal of Combinatorics</i>, vol. 29, no. 3. Electronic Journal of Combinatorics, 2022.","chicago":"Cooley, Oliver, Nicola Del Giudice, Mihyun Kang, and Philipp Sprüssel. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2022. <a href=\"https://doi.org/10.37236/10607\">https://doi.org/10.37236/10607</a>.","ama":"Cooley O, Del Giudice N, Kang M, Sprüssel P. Phase transition in cohomology groups of non-uniform random simplicial complexes. <i>Electronic Journal of Combinatorics</i>. 2022;29(3). doi:<a href=\"https://doi.org/10.37236/10607\">10.37236/10607</a>"},"intvolume":"        29","article_number":"P3.27","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"acknowledgement":"Supported by Austrian Science Fund (FWF): I3747, W1230.","day":"29","type":"journal_article","status":"public","has_accepted_license":"1","date_created":"2022-08-07T22:01:59Z","doi":"10.37236/10607","arxiv":1,"corr_author":"1","ddc":["510"],"publication_identifier":{"eissn":["1077-8926"]},"scopus_import":"1","title":"Phase transition in cohomology groups of non-uniform random simplicial complexes","issue":"3"},{"department":[{"_id":"MaKw"}],"abstract":[{"text":"Inspired by the study of loose cycles in hypergraphs, we define the loose core in hypergraphs as a structurewhich mirrors the close relationship between cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial random hypergraph $H^r(n,p)$, the order of the loose core undergoes a phase transition at a certain critical threshold and determine this order, as well as the number of edges, asymptotically in the subcritical and supercritical regimes.&#x0D;\r\nOur main tool is an algorithm called CoreConstruct, which enables us to analyse a peeling process for the loose core. By analysing this algorithm we determine the asymptotic degree distribution of vertices in the loose core and in particular how many vertices and edges the loose core contains. As a corollary we obtain an improved upper bound on the length of the longest loose cycle in $H^r(n,p)$.","lang":"eng"}],"external_id":{"isi":["000876763300001"]},"author":[{"last_name":"Cooley","first_name":"Oliver","id":"43f4ddd0-a46b-11ec-8df6-ef3703bd721d","full_name":"Cooley, Oliver"},{"full_name":"Kang, Mihyun","last_name":"Kang","first_name":"Mihyun"},{"first_name":"Julian","last_name":"Zalla","full_name":"Zalla, Julian"}],"oa":1,"article_type":"original","oa_version":"Published Version","_id":"12286","publication_status":"published","volume":29,"year":"2022","isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"relation":"main_file","content_type":"application/pdf","file_id":"12462","file_size":626953,"date_updated":"2023-01-30T11:45:13Z","file_name":"2022_ElecJournCombinatorics_Cooley_Kang_Zalla.pdf","checksum":"00122b2459f09b5ae43073bfba565e94","date_created":"2023-01-30T11:45:13Z","success":1,"creator":"dernst","access_level":"open_access"}],"file_date_updated":"2023-01-30T11:45:13Z","keyword":["Computational Theory and Mathematics","Geometry and Topology","Theoretical Computer Science","Applied Mathematics","Discrete Mathematics and Combinatorics"],"date_updated":"2023-08-04T10:29:18Z","month":"10","publisher":"The Electronic Journal of Combinatorics","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"No","publication":"The Electronic Journal of Combinatorics","citation":{"mla":"Cooley, Oliver, et al. “Loose Cores and Cycles in Random Hypergraphs.” <i>The Electronic Journal of Combinatorics</i>, vol. 29, no. 4, P4.13, The Electronic Journal of Combinatorics, 2022, doi:<a href=\"https://doi.org/10.37236/10794\">10.37236/10794</a>.","ieee":"O. Cooley, M. Kang, and J. Zalla, “Loose cores and cycles in random hypergraphs,” <i>The Electronic Journal of Combinatorics</i>, vol. 29, no. 4. The Electronic Journal of Combinatorics, 2022.","chicago":"Cooley, Oliver, Mihyun Kang, and Julian Zalla. “Loose Cores and Cycles in Random Hypergraphs.” <i>The Electronic Journal of Combinatorics</i>. The Electronic Journal of Combinatorics, 2022. <a href=\"https://doi.org/10.37236/10794\">https://doi.org/10.37236/10794</a>.","ama":"Cooley O, Kang M, Zalla J. Loose cores and cycles in random hypergraphs. <i>The Electronic Journal of Combinatorics</i>. 2022;29(4). doi:<a href=\"https://doi.org/10.37236/10794\">10.37236/10794</a>","short":"O. Cooley, M. Kang, J. Zalla, The Electronic Journal of Combinatorics 29 (2022).","ista":"Cooley O, Kang M, Zalla J. 2022. Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. 29(4), P4.13.","apa":"Cooley, O., Kang, M., &#38; Zalla, J. (2022). Loose cores and cycles in random hypergraphs. <i>The Electronic Journal of Combinatorics</i>. The Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/10794\">https://doi.org/10.37236/10794</a>"},"date_published":"2022-10-21T00:00:00Z","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"intvolume":"        29","article_number":"P4.13","day":"21","type":"journal_article","acknowledgement":"Supported by Austrian Science Fund (FWF): I3747, W1230.","date_created":"2023-01-16T10:03:57Z","doi":"10.37236/10794","status":"public","has_accepted_license":"1","publication_identifier":{"eissn":["1077-8926"]},"scopus_import":"1","ddc":["510"],"title":"Loose cores and cycles in random hypergraphs","issue":"4"},{"citation":{"ama":"Jelínek V, Töpfer M. On grounded L-graphs and their relatives. <i>Electronic Journal of Combinatorics</i>. 2019;26(3). doi:<a href=\"https://doi.org/10.37236/8096\">10.37236/8096</a>","chicago":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2019. <a href=\"https://doi.org/10.37236/8096\">https://doi.org/10.37236/8096</a>.","ieee":"V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” <i>Electronic Journal of Combinatorics</i>, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019.","mla":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” <i>Electronic Journal of Combinatorics</i>, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:<a href=\"https://doi.org/10.37236/8096\">10.37236/8096</a>.","ista":"Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17.","apa":"Jelínek, V., &#38; Töpfer, M. (2019). On grounded L-graphs and their relatives. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/8096\">https://doi.org/10.37236/8096</a>","short":"V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019)."},"date_published":"2019-07-19T00:00:00Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":"        26","article_number":"P3.17","month":"07","publisher":"Electronic Journal of Combinatorics","OA_place":"publisher","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"Yes","publication":"Electronic Journal of Combinatorics","scopus_import":"1","publication_identifier":{"eissn":["1077-8926"]},"ddc":["510"],"corr_author":"1","issue":"3","title":"On grounded L-graphs and their relatives","OA_type":"gold","day":"19","type":"journal_article","DOAJ_listed":"1","doi":"10.37236/8096","date_created":"2019-08-04T21:59:20Z","arxiv":1,"status":"public","has_accepted_license":"1","oa":1,"article_type":"original","oa_version":"Published Version","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"}],"_id":"6759","ec_funded":1,"department":[{"_id":"DaAl"}],"abstract":[{"text":"We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove that Grounded-L graphs admit an equivalent characterisation in terms of vertex ordering with forbidden patterns. \r\nWe also compare this class to related intersection classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. max point-tolerance graphs), or the outer-1-string graphs. We give constructions showing that these classes are all distinct and satisfy only trivial or previously known inclusions.","lang":"eng"}],"external_id":{"arxiv":["1808.04148"]},"author":[{"full_name":"Jelínek, Vít","last_name":"Jelínek","first_name":"Vít"},{"id":"4B865388-F248-11E8-B48F-1D18A9856A87","full_name":"Töpfer, Martin","last_name":"Töpfer","first_name":"Martin"}],"file_date_updated":"2020-07-14T12:47:39Z","date_updated":"2025-06-26T12:25:39Z","publication_status":"published","year":"2019","volume":26,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","checksum":"20fc366fc6683ef0b074a019b73a663a","date_created":"2019-08-05T06:46:55Z","creator":"dernst","file_name":"2019_eJourCombinatorics_Jelinek.pdf","relation":"main_file","content_type":"application/pdf","file_id":"6764","file_size":533697,"date_updated":"2020-07-14T12:47:39Z"}]},{"publication":"Electronic Journal of Combinatorics","quality_controlled":"1","article_processing_charge":"No","publisher":"Electronic Journal of Combinatorics","language":[{"iso":"eng"}],"month":"11","intvolume":"        22","article_number":"P4.24 ","citation":{"chicago":"Fulek, Radoslav, Jan Kynčl, Igor Malinovič, and Dömötör Pálvölgyi. “Clustered Planarity Testing Revisited.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2015. <a href=\"https://doi.org/10.37236/5002\">https://doi.org/10.37236/5002</a>.","ieee":"R. Fulek, J. Kynčl, I. Malinovič, and D. Pálvölgyi, “Clustered planarity testing revisited,” <i>Electronic Journal of Combinatorics</i>, vol. 22, no. 4. Electronic Journal of Combinatorics, 2015.","ama":"Fulek R, Kynčl J, Malinovič I, Pálvölgyi D. Clustered planarity testing revisited. <i>Electronic Journal of Combinatorics</i>. 2015;22(4). doi:<a href=\"https://doi.org/10.37236/5002\">10.37236/5002</a>","mla":"Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.” <i>Electronic Journal of Combinatorics</i>, vol. 22, no. 4, P4.24, Electronic Journal of Combinatorics, 2015, doi:<a href=\"https://doi.org/10.37236/5002\">10.37236/5002</a>.","ista":"Fulek R, Kynčl J, Malinovič I, Pálvölgyi D. 2015. Clustered planarity testing revisited. Electronic Journal of Combinatorics. 22(4), P4.24.","apa":"Fulek, R., Kynčl, J., Malinovič, I., &#38; Pálvölgyi, D. (2015). Clustered planarity testing revisited. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/5002\">https://doi.org/10.37236/5002</a>","short":"R. Fulek, J. Kynčl, I. Malinovič, D. Pálvölgyi, Electronic Journal of Combinatorics 22 (2015)."},"date_published":"2015-11-13T00:00:00Z","status":"public","has_accepted_license":"1","doi":"10.37236/5002","arxiv":1,"date_created":"2018-12-11T11:53:12Z","acknowledgement":"e research leading to these results has received funding fromthe People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme(FP7/2007-2013) under REA grant agreement no [291734], and ESF Eurogiga project GraDR as GAˇCRGIG/11/E023.","type":"journal_article","day":"13","title":"Clustered planarity testing revisited","issue":"4","publication_identifier":{"eissn":["1077-8926"]},"scopus_import":"1","publist_id":"5511","ddc":["514","516"],"corr_author":"1","external_id":{"arxiv":["1305.4519"]},"author":[{"first_name":"Radoslav","last_name":"Fulek","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","last_name":"Kynčl","full_name":"Kynčl, Jan"},{"full_name":"Malinovič, Igor","first_name":"Igor","last_name":"Malinovič"},{"full_name":"Pálvölgyi, Dömötör","first_name":"Dömötör","last_name":"Pálvölgyi"}],"abstract":[{"text":"The Hanani-Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generalize this result to clustered graphs with two disjoint clusters, and show that a straightforward extension to flat clustered graphs with three or more disjoint clusters is not possible. For general clustered graphs we show a variant of the Hanani-Tutte theorem in the case when each cluster induces a connected subgraph. Di Battista and Frati proved that clustered planarity of embedded clustered graphs whose every face is incident to at most five vertices can be tested in polynomial time. We give a new and short proof of this result, using the matroid intersection algorithm.","lang":"eng"}],"department":[{"_id":"UlWa"}],"_id":"1642","ec_funded":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"oa_version":"Published Version","article_type":"original","oa":1,"related_material":{"record":[{"id":"10793","status":"public","relation":"earlier_version"}]},"file":[{"access_level":"open_access","creator":"system","checksum":"40b5920b49ee736694f59f39588ee206","date_created":"2018-12-12T10:15:03Z","file_name":"IST-2016-714-v1+1_5002-15499-3-PB.pdf","file_size":443655,"date_updated":"2020-07-14T12:45:08Z","relation":"main_file","content_type":"application/pdf","file_id":"5120"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":22,"year":"2015","pubrep_id":"714","publication_status":"published","date_updated":"2025-06-26T07:57:45Z","file_date_updated":"2020-07-14T12:45:08Z"},{"publication":"The Electronic Journal of Combinatorics","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"The Electronic Journal of Combinatorics","month":"02","article_number":"P1.45","intvolume":"        21","date_published":"2014-02-28T00:00:00Z","citation":{"apa":"Greenhill, C., Kwan, M. A., &#38; Wind, D. (2014). On the number of spanning trees in random regular graphs. <i>The Electronic Journal of Combinatorics</i>. The Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/3752\">https://doi.org/10.37236/3752</a>","ista":"Greenhill C, Kwan MA, Wind D. 2014. On the number of spanning trees in random regular graphs. The Electronic Journal of Combinatorics. 21(1), P1.45.","short":"C. Greenhill, M.A. Kwan, D. Wind, The Electronic Journal of Combinatorics 21 (2014).","ieee":"C. Greenhill, M. A. Kwan, and D. Wind, “On the number of spanning trees in random regular graphs,” <i>The Electronic Journal of Combinatorics</i>, vol. 21, no. 1. The Electronic Journal of Combinatorics, 2014.","chicago":"Greenhill, Catherine, Matthew Alan Kwan, and David Wind. “On the Number of Spanning Trees in Random Regular Graphs.” <i>The Electronic Journal of Combinatorics</i>. The Electronic Journal of Combinatorics, 2014. <a href=\"https://doi.org/10.37236/3752\">https://doi.org/10.37236/3752</a>.","ama":"Greenhill C, Kwan MA, Wind D. On the number of spanning trees in random regular graphs. <i>The Electronic Journal of Combinatorics</i>. 2014;21(1). doi:<a href=\"https://doi.org/10.37236/3752\">10.37236/3752</a>","mla":"Greenhill, Catherine, et al. “On the Number of Spanning Trees in Random Regular Graphs.” <i>The Electronic Journal of Combinatorics</i>, vol. 21, no. 1, P1.45, The Electronic Journal of Combinatorics, 2014, doi:<a href=\"https://doi.org/10.37236/3752\">10.37236/3752</a>."},"status":"public","date_created":"2021-06-23T06:29:35Z","arxiv":1,"doi":"10.37236/3752","main_file_link":[{"url":"https://doi.org/10.37236/3752","open_access":"1"}],"day":"28","type":"journal_article","issue":"1","title":"On the number of spanning trees in random regular graphs","publication_identifier":{"eissn":["1077-8926"]},"scopus_import":"1","author":[{"full_name":"Greenhill, Catherine","last_name":"Greenhill","first_name":"Catherine"},{"last_name":"Kwan","first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan"},{"full_name":"Wind, David","last_name":"Wind","first_name":"David"}],"external_id":{"arxiv":["1309.6710"]},"extern":"1","abstract":[{"text":"Let d≥3 be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random d-regular graph with n vertices. (The asymptotics are as n→∞, restricted to even n if d is odd.) We also obtain the asymptotic distribution of the number of spanning trees in a uniformly random cubic graph, and conjecture that the corresponding result holds for arbitrary (fixed) d. Numerical evidence is presented which supports our conjecture.","lang":"eng"}],"_id":"9594","oa_version":"Published Version","article_type":"original","oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","volume":21,"year":"2014","publication_status":"published","date_updated":"2023-02-23T14:02:12Z"}]