{"year":"2023","intvolume":"        30","volume":30,"ddc":["510"],"project":[{"call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program"}],"file_date_updated":"2023-09-15T08:02:09Z","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).","external_id":{"arxiv":["2212.03100"]},"publication_identifier":{"eissn":["1077-8926"]},"doi":"10.37236/11714","has_accepted_license":"1","publication":"Electronic Journal of Combinatorics","author":[{"first_name":"Michael","last_name":"Anastos","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","full_name":"Anastos, Michael"},{"full_name":"Fabian, David","last_name":"Fabian","first_name":"David"},{"last_name":"Müyesser","first_name":"Alp","full_name":"Müyesser, Alp"},{"full_name":"Szabó, Tibor","last_name":"Szabó","first_name":"Tibor"}],"language":[{"iso":"eng"}],"_id":"14319","article_number":"P3.10","ec_funded":1,"article_type":"original","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>.","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.","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>","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>.","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>","short":"M. Anastos, D. Fabian, A. Müyesser, T. Szabó, Electronic Journal of Combinatorics 30 (2023)."},"publisher":"Electronic Journal of Combinatorics","scopus_import":"1","oa":1,"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-09-10T22:01:12Z","title":"Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets","quality_controlled":"1","status":"public","article_processing_charge":"Yes","month":"07","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","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)"},"date_updated":"2023-09-15T08:12:30Z","file":[{"file_size":247917,"date_created":"2023-09-15T08:02:09Z","file_id":"14338","success":1,"date_updated":"2023-09-15T08:02:09Z","file_name":"2023_elecJournCombinatorics_Anastos.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","relation":"main_file","checksum":"52c46c8cb329f9aaee9ade01525f317b"}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","type":"journal_article","day":"28","department":[{"_id":"MaKw"}],"abstract":[{"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.","lang":"eng"}],"date_published":"2023-07-28T00:00:00Z","publication_status":"published","issue":"3"}