{"department":[{"_id":"542"}],"citation":{"bibtex":"@article{Ma_Mattiolo_Steffen_Wolf_2024, title={Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs}, volume={44}, DOI={<a href=\"https://doi.org/10.1007/s00493-023-00078-9\">10.1007/s00493-023-00078-9</a>}, journal={Combinatorica}, publisher={Springer Science and Business Media LLC}, author={Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2024}, pages={429–440} }","ieee":"Y. Ma, D. Mattiolo, E. Steffen, and I. H. Wolf, “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs,” <i>Combinatorica</i>, vol. 44, pp. 429–440, 2024, doi: <a href=\"https://doi.org/10.1007/s00493-023-00078-9\">10.1007/s00493-023-00078-9</a>.","ama":"Ma Y, Mattiolo D, Steffen E, Wolf IH. Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. <i>Combinatorica</i>. 2024;44:429-440. doi:<a href=\"https://doi.org/10.1007/s00493-023-00078-9\">10.1007/s00493-023-00078-9</a>","short":"Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, Combinatorica 44 (2024) 429–440.","apa":"Ma, Y., Mattiolo, D., Steffen, E., &#38; Wolf, I. H. (2024). Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. <i>Combinatorica</i>, <i>44</i>, 429–440. <a href=\"https://doi.org/10.1007/s00493-023-00078-9\">https://doi.org/10.1007/s00493-023-00078-9</a>","mla":"Ma, Yulai, et al. “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs.” <i>Combinatorica</i>, vol. 44, Springer Science and Business Media LLC, 2024, pp. 429–40, doi:<a href=\"https://doi.org/10.1007/s00493-023-00078-9\">10.1007/s00493-023-00078-9</a>.","chicago":"Ma, Yulai, Davide Mattiolo, Eckhard Steffen, and Isaak Hieronymus Wolf. “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs.” <i>Combinatorica</i> 44 (2024): 429–40. <a href=\"https://doi.org/10.1007/s00493-023-00078-9\">https://doi.org/10.1007/s00493-023-00078-9</a>."},"publisher":"Springer Science and Business Media LLC","volume":44,"keyword":["Computational Mathematics","Discrete Mathematics and Combinatorics"],"type":"journal_article","author":[{"id":"92748","first_name":"Yulai","last_name":"Ma","full_name":"Ma, Yulai"},{"last_name":"Mattiolo","full_name":"Mattiolo, Davide","first_name":"Davide"},{"orcid":"0000-0002-9808-7401","full_name":"Steffen, Eckhard","last_name":"Steffen","id":"15548","first_name":"Eckhard"},{"first_name":"Isaak Hieronymus","id":"88145","full_name":"Wolf, Isaak Hieronymus","last_name":"Wolf"}],"year":"2024","publication_identifier":{"issn":["0209-9683","1439-6912"]},"user_id":"15540","_id":"49905","status":"public","date_created":"2023-12-20T10:31:27Z","doi":"10.1007/s00493-023-00078-9","publication_status":"published","publication":"Combinatorica","abstract":[{"lang":"eng","text":"For 0 ≤ t ≤ r let m(t, r) be the maximum number s such that every t-edge-connected r-graph has s pairwise disjoint perfect matchings. There are only a few values of m(t, r) known, for instance m(3, 3) = m(4, r) = 1, and m(t, r) ≤ r − 2 for all t \u0003 = 5,\r\nand m(t, r) ≤ r − 3 if r is even. We prove that m(2l, r) ≤ 3l − 6 for every l ≥ 3 and r ≥ 2l."}],"title":"Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs","date_updated":"2024-03-22T12:11:35Z","page":"429-440","language":[{"iso":"eng"}],"intvolume":"        44"}