{"id":"https://openalex.org/W7139961355","doi":"https://doi.org/10.48550/arxiv.2603.18232","title":"On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope","display_name":"On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope","publication_year":2026,"publication_date":"2026-03-18","ids":{"openalex":"https://openalex.org/W7139961355","doi":"https://doi.org/10.48550/arxiv.2603.18232"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.18232","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18232","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.18232","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027137195","display_name":"Martin N\u00e4gele","orcid":"https://orcid.org/0000-0002-3059-6402"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"N\u00e4gele, Martin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030092639","display_name":"Christian N\u00f6bel","orcid":"https://orcid.org/0000-0001-6864-1953"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N\u00f6bel, Christian","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130223666","display_name":"Rico Zenklusen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zenklusen, Rico","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027137195"],"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6718000173568726,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6718000173568726,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.24940000474452972,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.011599999852478504,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/bipartite-graph","display_name":"Bipartite graph","score":0.9072999954223633},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.8270000219345093},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7150999903678894},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.5615000128746033},{"id":"https://openalex.org/keywords/perfect-power","display_name":"Perfect power","score":0.4726000130176544},{"id":"https://openalex.org/keywords/facet","display_name":"Facet (psychology)","score":0.43799999356269836},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.427700012922287},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.39959999918937683},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.3732999861240387}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9072999954223633},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8270000219345093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7157999873161316},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7150999903678894},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.640999972820282},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.5615000128746033},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4878999888896942},{"id":"https://openalex.org/C93446932","wikidata":"https://www.wikidata.org/wiki/Q1972803","display_name":"Perfect power","level":2,"score":0.4726000130176544},{"id":"https://openalex.org/C43122875","wikidata":"https://www.wikidata.org/wiki/Q5428522","display_name":"Facet (psychology)","level":4,"score":0.43799999356269836},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.427700012922287},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.39959999918937683},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.3732999861240387},{"id":"https://openalex.org/C174248988","wikidata":"https://www.wikidata.org/wiki/Q8348314","display_name":"Polyhedral combinatorics","level":5,"score":0.37220001220703125},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3653999865055084},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.36059999465942383},{"id":"https://openalex.org/C161487630","wikidata":"https://www.wikidata.org/wiki/Q2800071","display_name":"Perfect graph theorem","level":5,"score":0.34040001034736633},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3395000100135803},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3391999900341034},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2752000093460083},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27000001072883606},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.25279998779296875},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.25}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.18232","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18232","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.48550/arxiv.2603.18232","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18232","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":false,"raw_source_name":null,"raw_type":"article"},"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":{"The":[0],"odd-red":[1,159],"bipartite":[2,24,96,142,160,203],"perfect":[3,10,97,105,143,161,204],"matching":[4,11,98,106,144,162,205],"problem":[5,28,119],"asks":[6,101],"to":[7,40,73,102,193,250,263],"find":[8,103],"a":[9,20,56,89,104,123],"containing":[12],"an":[13,169,178,252],"odd":[14],"number":[15],"of":[16,59,75,139],"red":[17,110],"edges":[18],"in":[19,30,82,148,232],"given":[21],"red-blue":[22],"edge-colored":[23],"graph.":[25],"While":[26],"this":[27,118,165,185],"lies":[29],"$\\mathsf{P}$,":[31],"its":[32],"polyhedral":[33,43,64,125],"structure":[34,65],"remains":[35],"elusive,":[36],"despite":[37],"renewed":[38],"attention":[39],"achieving":[41],"better":[42],"understanding,":[44],"nurtured":[45],"by":[46,128],"recent":[47],"advances":[48],"from":[49,54,182,244],"two":[50],"complementary":[51],"angles.":[52],"Apart":[53,181],"being":[55],"special":[57],"case":[58],"bimodular":[60,264],"integer":[61,265],"programs,":[62],"whose":[63],"is":[66,71,88,146,153,177,187],"also":[67,260],"badly":[68],"understood,":[69],"it":[70,176],"related":[72],"one":[74],"the":[76,94,136,140,157,201,236],"most":[77],"notorious":[78],"open":[79,174],"derandomization":[80],"questions":[81],"theoretical":[83],"computer":[84],"science:":[85],"whether":[86,175],"there":[87],"deterministic":[90,115],"efficient":[91],"algorithm":[92],"for":[93,117,156],"exact":[95,141,179,189,212,253],"problem,":[99,166],"which":[100],"with":[107,216,229],"exactly":[108],"$k$":[109],"edges.":[111],"Recent":[112],"progress":[113],"towards":[114],"algorithms":[116],"crucially":[120],"relies":[121],"on":[122,227],"good":[124],"understanding.":[126],"Motivated":[127],"this,":[129],"Jia,":[130],"Svensson,":[131],"and":[132,172,190,218,239],"Yuan":[133],"show":[134],"that":[135,184,200,241,259],"extension":[137],"complexity":[138],"polytope":[145,206],"exponential":[147],"general.":[149],"Interestingly,":[150],"their":[151],"result":[152],"true":[154],"even":[155,191],"easier":[158],"problem.":[163],"For":[164],"they":[167],"introduce":[168],"exponential-size":[170],"relaxation":[171],"leave":[173],"description.":[180,254],"showing":[183],"description":[186,213],"not":[188],"hard":[192],"separate":[194],"over,":[195],"we":[196,257],"show,":[197],"more":[198],"importantly,":[199],"red-odd":[202],"exhibits":[207],"complex":[208,268],"facet":[209,269],"structure:":[210],"any":[211],"needs":[214],"constraints":[215,228],"large":[217],"diverse":[219],"coefficients.":[220],"This":[221],"rules":[222],"out":[223],"classical":[224],"relaxations":[225],"based":[226],"all":[230],"coefficients":[231],"$\\{0,\\pm1\\}$,":[233],"such":[234],"as":[235],"above-mentioned":[237],"one,":[238],"suggests":[240],"significant":[242],"deviations":[243],"prior":[245],"approaches":[246],"may":[247],"be":[248],"needed":[249],"obtain":[251,258],"More":[255],"generally,":[256],"polytopes":[261],"corresponding":[262],"programs":[266],"have":[267],"structure.":[270]},"counts_by_year":[],"updated_date":"2026-03-21T06:36:02.116451","created_date":"2026-03-21T00:00:00"}