{"id":"https://openalex.org/W1509897706","doi":"https://doi.org/10.37236/5246","title":"Rainbow Matchings and Rainbow Connectedness","display_name":"Rainbow Matchings and Rainbow Connectedness","publication_year":2017,"publication_date":"2017-02-03","ids":{"openalex":"https://openalex.org/W1509897706","doi":"https://doi.org/10.37236/5246","mag":"1509897706"},"language":"en","primary_location":{"id":"doi:10.37236/5246","is_oa":true,"landing_page_url":"https://doi.org/10.37236/5246","pdf_url":null,"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":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.37236/5246","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078906046","display_name":"Alexey Pokrovskiy","orcid":"https://orcid.org/0000-0002-8989-3962"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Alexey Pokrovskiy","raw_affiliation_strings":["ETH, Zurich","[ETH, Zurich]"],"affiliations":[{"raw_affiliation_string":"ETH, Zurich","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"[ETH, Zurich]","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078906046"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":0.1321389,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.46949073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"24","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":1.0,"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/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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9969000220298767,"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.8775174617767334},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8332836627960205},{"id":"https://openalex.org/keywords/rainbow","display_name":"Rainbow","score":0.8200573921203613},{"id":"https://openalex.org/keywords/social-connectedness","display_name":"Social connectedness","score":0.7609363198280334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6248391270637512},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5768583416938782},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5641103982925415},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5619044303894043},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5607316493988037},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5302790403366089},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43906328082084656},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3728383183479309},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37256139516830444},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06992554664611816},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06288665533065796}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.8775174617767334},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8332836627960205},{"id":"https://openalex.org/C2776558979","wikidata":"https://www.wikidata.org/wiki/Q1052","display_name":"Rainbow","level":2,"score":0.8200573921203613},{"id":"https://openalex.org/C201943243","wikidata":"https://www.wikidata.org/wiki/Q7551008","display_name":"Social connectedness","level":2,"score":0.7609363198280334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6248391270637512},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5768583416938782},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5641103982925415},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5619044303894043},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5607316493988037},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5302790403366089},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43906328082084656},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3728383183479309},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37256139516830444},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06992554664611816},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06288665533065796},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.37236/5246","is_oa":true,"landing_page_url":"https://doi.org/10.37236/5246","pdf_url":null,"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"},{"id":"pmh:oai:eprints.bbk.ac.uk.oai2:25891","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400466","display_name":"BIROn (Birkbeck, University of London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98259816","host_organization_name":"Birkbeck, University of London","host_organization_lineage":["https://openalex.org/I98259816"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:arXiv.org:1504.05373","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1504.05373","pdf_url":"https://arxiv.org/pdf/1504.05373","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10112660","is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10112660/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"   Electronic Journal of Combinatorics , 24  (1)    , Article P1.13. (2017)      ","raw_type":"Article"},{"id":"doi:10.48550/arxiv.1504.05373","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1504.05373","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.37236/5246","is_oa":true,"landing_page_url":"https://doi.org/10.37236/5246","pdf_url":null,"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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W287611495","https://openalex.org/W1506619093","https://openalex.org/W1512610850","https://openalex.org/W1527246840","https://openalex.org/W1568175246","https://openalex.org/W1805521509","https://openalex.org/W1995329354","https://openalex.org/W2004308928","https://openalex.org/W2075475446","https://openalex.org/W2082184422","https://openalex.org/W2125943335","https://openalex.org/W2320743697","https://openalex.org/W2949690312"],"related_works":["https://openalex.org/W2964145064","https://openalex.org/W2178416479","https://openalex.org/W3117337202","https://openalex.org/W2962857703","https://openalex.org/W2533448905","https://openalex.org/W3131597004","https://openalex.org/W2765991895","https://openalex.org/W2774697480","https://openalex.org/W2963868941","https://openalex.org/W2901606536","https://openalex.org/W2804025813","https://openalex.org/W3122563913","https://openalex.org/W3106377484","https://openalex.org/W3164859748","https://openalex.org/W2257301770","https://openalex.org/W3202249173","https://openalex.org/W1857673085","https://openalex.org/W3107721479","https://openalex.org/W2963734391","https://openalex.org/W2807496761"],"abstract_inverted_index":{"Aharoni":[0],"and":[1,35,76,97,108,138,189],"Berger":[2],"conjectured":[3],"that":[4,127,184],"every":[5],"collection":[6],"of":[7,10,21,32,86,106,182,191],"$n$":[8],"matchings":[9,61,84,93,116,134,158],"size":[11,22,87,118,136,160],"$n+1$":[12],"in":[13,39,176],"a":[14,18,104],"bipartite":[15],"graph":[16],"contains":[17],"rainbow":[19],"matching":[20],"$n$.":[23],"This":[24],"conjecture":[25,54,81,113,129,155],"is":[26,55,70,130,168,187],"related":[27],"to":[28,57,73,152],"several":[29],"old":[30],"conjectures":[31],"Ryser,":[33],"Brualdi,":[34],"Stein":[36],"about":[37,49],"transversals":[38],"Latin":[40],"squares.":[41],"There":[42],"have":[43,117,135,159],"been":[44],"many":[45],"recent":[46],"partial":[47],"results":[48],"the":[50,60,80,83,92,99,112,115,128,133,154,157,169],"Aharoni-Berger":[51],"Conjecture.":[52],"The":[53,67,180],"known":[56],"hold":[58],"when":[59,82,114,132,156],"are":[62,85,94,139],"much":[63],"larger":[64],"than":[65],"$n+1$.":[66],"best":[68,100],"bound":[69],"currently":[71],"due":[72],"Aharoni,":[74],"Kotlar,":[75],"Ziv":[77],"who":[78],"proved":[79],"at":[88,119,161],"least":[89,120,162],"$3n/2+1$.":[90],"When":[91],"all":[95,140],"edge-disjoint":[96,141],"perfect,":[98],"result":[101],"follows":[102],"from":[103],"theorem":[105],"H\u00e4ggkvist":[107],"Johansson":[109],"which":[110],"implies":[111],"$n+o(n)$.":[121],"In":[122],"this":[123],"paper":[124],"we":[125,185],"show":[126],"true":[131],"$n+o(n)$":[137],"(but":[142],"not":[143],"necessarily":[144],"perfect).":[145],"We":[146],"also":[147],"give":[148],"an":[149],"alternative":[150],"argument":[151],"prove":[153],"$\\phi":[163],"n+o(n)$":[164],"where":[165],"$\\phi\\approx":[166],"1.618$":[167],"Golden":[170],"Ratio.Our":[171],"proofs":[172],"involve":[173],"studying":[174],"connectedness":[175,183],"coloured,":[177],"directed":[178],"graphs.":[179],"notion":[181],"introduce":[186],"new,":[188],"perhaps":[190],"independent":[192],"interest.":[193]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}