{"id":"https://openalex.org/W7167628306","doi":"https://doi.org/10.48550/arxiv.2607.02619","title":"Polynomial Algorithms for Minimum Degree Partitions in Semicomplete Digraphs","display_name":"Polynomial Algorithms for Minimum Degree Partitions in Semicomplete Digraphs","publication_year":2026,"publication_date":"2026-07-02","ids":{"openalex":"https://openalex.org/W7167628306","doi":"https://doi.org/10.48550/arxiv.2607.02619"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.02619","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.02619","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.2607.02619","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139266988","display_name":"Hanzhi Bai","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bai, Hanzhi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5140215138","display_name":"Jin Yan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yan, Jin","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4106000065803528,"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.4106000065803528,"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.24469999969005585,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.08659999817609787,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.8363999724388123},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7792999744415283},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5813000202178955},{"id":"https://openalex.org/keywords/frequency-partition-of-a-graph","display_name":"Frequency partition of a graph","score":0.54830002784729},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5343000292778015},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5236999988555908},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4090999960899353},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.35530000925064087}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8363999724388123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7950999736785889},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7792999744415283},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.673799991607666},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5813000202178955},{"id":"https://openalex.org/C178744013","wikidata":"https://www.wikidata.org/wiki/Q5502876","display_name":"Frequency partition of a graph","level":5,"score":0.54830002784729},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5343000292778015},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5236999988555908},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48190000653266907},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4090999960899353},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37700000405311584},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.35530000925064087},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3474999964237213},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32710000872612},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31859999895095825},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.31369999051094055},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2865999937057495},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.02619","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.02619","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.2607.02619","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.02619","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":{"A":[0],"2-partition":[1,17],"of":[2,8,33,82],"a":[3,6,94,99,103,108,115,150],"digraph":[4,97],"is":[5],"partition":[7,48,116,154],"its":[9],"vertex":[10],"set":[11],"into":[12],"two":[13],"nonempty":[14],"parts.":[15],"Degree-constrained":[16],"problems":[18,49],"are":[19,28,61],"generally":[20],"computationally":[21],"difficult,":[22],"even":[23],"when":[24,57],"the":[25,46,58,68,123],"prescribed":[26],"properties":[27],"expressed":[29],"only":[30],"in":[31,153],"terms":[32],"minimum":[34,36,39,124],"indegree,":[35],"outdegree,":[37],"or":[38,107],"semidegree.":[40],"Bang-Jensen":[41,64],"and":[42,63,65,112,138,141],"Christiansen~\\cite{B-C}":[43],"conjectured":[44],"that":[45,91],"minimum-degree":[47],"would":[50],"be":[51],"polynomial-time":[52,89],"solvable":[53],"on":[54],"semicomplete":[55,96],"digraphs":[56],"degree":[59,133],"thresholds":[60],"fixed,":[62],"Gutin~\\cite{B-G-Classes}":[66],"posed":[67],"related":[69],"Problems~2.8.15":[70],"and~2.8.16.":[71],"We":[72],"resolve":[73],"this":[74],"conjecture.":[75],"More":[76],"precisely,":[77],"for":[78],"every":[79],"fixed":[80],"pair":[81],"integers":[83],"$k_1,k_2\\ge":[84],"2$,":[85],"we":[86],"give":[87],"deterministic":[88,142],"algorithms":[90,130],"decide":[92],"whether":[93],"given":[95],"admits":[98],"$(\u03b4^+\\geq":[100,104],"k_1,\u03b4^-\\geq":[101],"k_2)$-partition,":[102,106,111],"k_1,\u03b4^0\\geq":[105,110],"$(\u03b4^0\\geq":[109],"construct":[113],"such":[114],"whenever":[117],"one":[118],"exists.":[119],"Here,":[120],"$\u03b4^+,\u03b4^-,\u03b4^0$":[121],"represent":[122],"out-,":[125],"in-,":[126],"semi-degree,":[127],"respectively.":[128],"The":[129],"use":[131],"small":[132],"certificates,":[134],"minimal":[135],"cores,":[136],"closure":[137],"protective-set":[139],"arguments,":[140],"universal":[143],"colorings":[144],"with":[145],"monotone":[146],"recoloring,":[147],"which":[148],"develop":[149],"new":[151],"method":[152],"algorithm":[155],"construction.":[156]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-08T00:00:00"}