{"id":"https://openalex.org/W4385357696","doi":"https://doi.org/10.37236/11714","title":"Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets","display_name":"Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets","publication_year":2023,"publication_date":"2023-07-27","ids":{"openalex":"https://openalex.org/W4385357696","doi":"https://doi.org/10.37236/11714"},"language":"en","primary_location":{"id":"doi:10.37236/11714","is_oa":true,"landing_page_url":"https://doi.org/10.37236/11714","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i3p10/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i3p10/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039301099","display_name":"Michael Anastos","orcid":"https://orcid.org/0000-0001-5475-6522"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Anastos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071972187","display_name":"David M. Fabian","orcid":"https://orcid.org/0000-0001-7678-2633"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Fabian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004919465","display_name":"Alp M\u00fcyesser","orcid":"https://orcid.org/0009-0006-3702-9749"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alp M\u00fcyesser","raw_affiliation_strings":["University College London"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College London","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068960247","display_name":"Tibor Szab\u00f3","orcid":"https://orcid.org/0000-0003-0599-0624"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tibor Szab\u00f3","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6248,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58546571,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"30","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9693999886512756,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9560999870300293,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.9142504930496216},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8602238297462463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7810300588607788},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7742974758148193},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5156437158584595},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46404144167900085},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4613644480705261},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42888593673706055}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.9142504930496216},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8602238297462463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7810300588607788},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7742974758148193},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5156437158584595},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46404144167900085},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4613644480705261},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42888593673706055},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/11714","is_oa":true,"landing_page_url":"https://doi.org/10.37236/11714","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i3p10/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/11714","is_oa":true,"landing_page_url":"https://doi.org/10.37236/11714","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i3p10/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4608865072","display_name":"IST-BRIDGE: International postdoctoral program","funder_award_id":"101034413","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5489237795","display_name":null,"funder_award_id":"GRK 2434","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4385357696.pdf"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W2567004493","https://openalex.org/W2892072932","https://openalex.org/W2922282992","https://openalex.org/W2963204803","https://openalex.org/W3005926255","https://openalex.org/W3022327648","https://openalex.org/W4242877767","https://openalex.org/W4394645419"],"related_works":["https://openalex.org/W4297676365","https://openalex.org/W1645173339","https://openalex.org/W2908698948","https://openalex.org/W4288280572","https://openalex.org/W4320022211","https://openalex.org/W3040670847","https://openalex.org/W2963091545","https://openalex.org/W2990042548","https://openalex.org/W4285056899","https://openalex.org/W3049229033"],"abstract_inverted_index":{"We":[0,71,83],"study":[1],"multigraphs":[2],"whose":[3],"edge-sets":[4],"are":[5],"the":[6,48,62,89],"union":[7],"of":[8,35],"three":[9],"perfect":[10],"matchings,":[11],"$M_1$,":[12],"$M_2$,":[13],"and":[14,21],"$M_3$.":[15],"Given":[16],"such":[17,77],"a":[18,32,73,78,86],"graph":[19],"$G$":[20,36,59],"any":[22],"$a_1,a_2,a_3\\in":[23],"\\mathbb{N}$":[24],"with":[25,37,66,92],"$a_1+a_2+a_3\\leq":[26],"n-2$,":[27],"we":[28],"show":[29],"there":[30],"exists":[31],"matching":[33],"$M$":[34],"$|M\\cap":[38],"M_i|=a_i$":[39],"for":[40],"each":[41],"$i\\in":[42],"\\{1,2,3\\}$.":[43],"The":[44],"bound":[45],"$n-2$":[46,67],"in":[47,53],"theorem":[49],"is":[50,60],"best":[51],"possible":[52],"general.We":[54],"conjecture":[55,87,91],"however":[56],"that":[57,75],"if":[58],"bipartite,":[61],"same":[63],"result":[64,79],"holds":[65],"replaced":[68],"by":[69],"$n-1$.":[70],"give":[72],"construction":[74],"shows":[76],"would":[80],"be":[81],"tight.":[82],"also":[84],"make":[85],"generalising":[88],"Ryser-Brualdi-Stein":[90],"colour":[93],"multiplicities.":[94]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-09T07:52:08.696243","created_date":"2025-10-10T00:00:00"}
