{"id":"https://openalex.org/W7139937084","doi":"https://doi.org/10.48550/arxiv.2603.18754","title":"The red-blue-yellow matching problem","display_name":"The red-blue-yellow matching problem","publication_year":2026,"publication_date":"2026-03-19","ids":{"openalex":"https://openalex.org/W7139937084","doi":"https://doi.org/10.48550/arxiv.2603.18754"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.18754","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18754","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.18754","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071692531","display_name":"Manuel Aprile","orcid":"https://orcid.org/0000-0002-6805-6903"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aprile, Manuel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5086066603","display_name":"Marco Di Summa","orcid":"https://orcid.org/0000-0001-7223-0380"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Di Summa, Marco","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.6230000257492065,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.6230000257492065,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.10360000282526016,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.07850000262260437,"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/matching","display_name":"Matching (statistics)","score":0.646399974822998},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.633400022983551},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4991999864578247},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4781999886035919},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.45010000467300415},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4262000024318695},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4088999927043915},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4032000005245209},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.39809998869895935}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7092999815940857},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.646399974822998},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.633400022983551},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5449000000953674},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4991999864578247},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4781999886035919},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.45010000467300415},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44179999828338623},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4262000024318695},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4032000005245209},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.39809998869895935},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.391400009393692},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.3652999997138977},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3596999943256378},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3296999931335449},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.3273000121116638},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.31060001254081726},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.29829999804496765},{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.26080000400543213},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.25200000405311584},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.18754","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18754","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.18754","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18754","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,24,59,92,113,130,141,196],"red-blue-yellow":[3,114],"matching":[4,30,63,94,115,128],"problem:":[5],"given":[6],"two":[7],"natural":[8,56,124],"numbers":[9],"$k_R$,":[10],"$k_B$":[11,41],"and":[12,39,44,135,154,167,192],"a":[13,29,55,71,76,109,118,127,147,170,175,184,188],"graph":[14],"$G$":[15,32],"whose":[16,65],"edges":[17,38],"are":[18],"colored":[19],"red,":[20],"blue":[21,42],"or":[22],"yellow,":[23],"goal":[25],"is":[26,45,54,68,146,183],"to":[27,50,91,97],"find":[28],"of":[31,46,58,140,149,162,179,187,199],"that":[33],"contains":[34],"exactly":[35,40,134],"$k_R$":[36],"red":[37],"edges,":[43],"maximum":[47],"cardinality":[48,137],"subject":[49],"these":[51],"constraints.":[52],"This":[53],"generalization":[57],"well":[60],"known":[61,88],"red-blue":[62,93],"problem,":[64,95,116],"complexity":[66],"status":[67],"unknown:":[69],"although":[70],"randomized":[72],"polynomial-time":[73,119],"algorithm":[74,78,121,145],"exists,":[75],"deterministic":[77,89,120],"has":[79,136],"remained":[80],"elusive":[81],"for":[82,112],"nearly":[83],"four":[84],"decades.":[85],"The":[86],"best":[87],"approach":[90],"due":[96],"Yuster":[98],"(2012),":[99],"gives":[100],"an":[101],"additive":[102],"approximation.":[103],"In":[104],"this":[105],"paper,":[106],"we":[107,173],"show":[108],"similar":[110],"result":[111,189],"giving":[117],"that,":[122],"under":[123],"assumptions,":[125],"finds":[126],"satisfying":[129],"color":[131],"requirements":[132],"almost":[133],"within":[138],"3":[139],"optimal":[142],"solution.":[143],"Our":[144],"mix":[148],"classic":[150],"linear":[151],"programming":[152],"techniques":[153],"ad":[155],"hoc":[156],"existence":[157],"results":[158],"on":[159],"restricted":[160],"classes":[161],"graphs":[163],"such":[164],"as":[165],"paths":[166],"cycles.":[168],"As":[169],"key":[171],"ingredient,":[172],"prove":[174],"curious":[176],"topological":[177],"property":[178],"plane":[180],"curves,":[181],"which":[182],"strengthened":[185],"version":[186],"by":[190],"Grandoni":[191],"Zenklusen":[193],"(2010)":[194],"in":[195],"related":[197],"context":[198],"budgeted":[200],"matchings.":[201]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-21T00:00:00"}