{"id":"https://openalex.org/W7204202157","doi":"https://doi.org/10.48550/arxiv.2608.22308","title":"Spanning trees in the Assignment Problem: two theorems and two conjectures","display_name":"Spanning trees in the Assignment Problem: two theorems and two conjectures","publication_year":2026,"publication_date":"2026-08-23","ids":{"openalex":"https://openalex.org/W7204202157","doi":"https://doi.org/10.48550/arxiv.2608.22308"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2608.22308","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.22308","pdf_url":"https://arxiv.org/pdf/2608.22308","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,"listed_in":[],"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":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2608.22308","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004431756","display_name":"Sergio Caracciolo A","orcid":"https://orcid.org/0000-0003-3028-2988","observed_orcids":["https://orcid.org/0000-0003-3028-2988"]},"institutions":[{"id":"https://openalex.org/I4210136779","display_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Milano","ror":"https://ror.org/04w4m6z96","country_code":"IT","type":"facility","lineage":["https://openalex.org/I160013858","https://openalex.org/I4210136779"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Caracciolo, Sergio","raw_affiliation_strings":["INFN , sezione di Milano , Milano , Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INFN , sezione di Milano , Milano , Italy","institution_ids":["https://openalex.org/I4210136779"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082757021","display_name":"Gabriele Sicuro","orcid":"https://orcid.org/0000-0002-9258-2436","observed_orcids":["https://orcid.org/0000-0002-9258-2436"]},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["FR","IT"],"is_corresponding":false,"raw_author_name":"Sicuro, Gabriele","raw_affiliation_strings":["CNRS & LIPN , Universit\u00e9 Paris Nord , Villetaneuse , France","Department of Mathematics , University of Bologna , Bologna , Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS & LIPN , Universit\u00e9 Paris Nord , Villetaneuse , France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583"]},{"raw_affiliation_string":"Department of Mathematics , University of Bologna , Bologna , Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066235721","display_name":"Andrea Sportiello","orcid":"https://orcid.org/0000-0002-6502-3954","observed_orcids":["https://orcid.org/0000-0002-6502-3954"]},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Sportiello, Andrea","raw_affiliation_strings":["Department of Mathematics , University of Bologna , Bologna , Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics , University of Bologna , Bologna , Italy","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.6161999702453613,"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.6161999702453613,"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/T10229","display_name":"Geometric Analysis and Curvature Flows","score":0.14669999480247498,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.06840000301599503,"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/assignment-problem","display_name":"assignment problem","score":0.8880000114440918},{"id":"https://openalex.org/keywords/spanning-trees","display_name":"spanning trees","score":0.9670000076293945},{"id":"https://openalex.org/keywords/optimal-matching","display_name":"optimal matching","score":0.7889999747276306},{"id":"https://openalex.org/keywords/uniform-spanning-tree","display_name":"uniform spanning tree","score":0.9729999899864197},{"id":"https://openalex.org/keywords/schramm-loewner-evolution","display_name":"Schramm-Loewner evolution","score":0.9539999961853027},{"id":"https://openalex.org/keywords/planar-point-sets","display_name":"planar point sets","score":0.5960000157356262}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8007000088691711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7921000123023987},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7659000158309937},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5787000060081482},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48570001125335693},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4650000035762787},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4643999934196472},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4618000090122223},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.45320001244544983},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.44749999046325684},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3995000123977661},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.3968999981880188},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.382999986410141},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.38199999928474426},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.38109999895095825},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.37880000472068787},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.3635999858379364},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.34049999713897705},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3325999975204468},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.33090001344680786},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3294999897480011},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.3260999917984009},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3012000024318695},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.2858000099658966},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.27889999747276306},{"id":"https://openalex.org/C48659774","wikidata":"https://www.wikidata.org/wiki/Q4907197","display_name":"Bijection, injection and surjection","level":3,"score":0.2702000141143799},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.26510000228881836},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.25940001010894775}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2608.22308","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.22308","pdf_url":"https://arxiv.org/pdf/2608.22308","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,"listed_in":[],"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":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2608.22308","doi":"https://doi.org/10.48550/arxiv.2608.22308","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2608.22308","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,"listed_in":[],"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":"pmh:oai:arXiv.org:2608.22308","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.22308","pdf_url":"https://arxiv.org/pdf/2608.22308","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,"listed_in":[],"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":null,"raw_type":"text"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3010527862","display_name":null,"funder_award_id":"ANR\u201019","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G3063031753","display_name":"Enumerative combinatorics and applications: random and exhaustive generation","funder_award_id":"ANR-25-CE48-0602","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4656594441","display_name":null,"funder_award_id":"ANR18","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G699481650","display_name":"Dimers: from combinatorics to quantum mechanics","funder_award_id":"ANR-18-CE40-0033","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G842795366","display_name":"Enumerative combinative: interactions with algebra, number theory and physics","funder_award_id":"ANR-19-CE48-0011","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7204202157.pdf","grobid_xml":"https://content.openalex.org/works/W7204202157.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"\\emph{Minimum":[1],"Matching":[2],"Problem}":[3],"consists":[4],"of":[5,11,35,43,51,63,114],"finding":[6],"an":[7],"independent":[8],"edge":[9,106],"set":[10],"minimum":[12],"weight":[13],"$M_{\\star}(G)$":[14],"in":[15,120,156,162,165,200,212,221],"a":[16,33,176],"given":[17,109],"edge-weighted":[18],"graph":[19],"$G$.":[20],"When":[21],"$G$":[22,96],"is":[23,131,149],"bipartite,":[24],"this":[25,36],"reduces":[26],"to":[27,159],"the":[28,41,52,71,77,92,105,111,121,128,145,166,184,201,210,213,222],"\\emph{Assignment":[29],"Problem}.":[30],"We":[31,59],"consider":[32],"variant":[34],"problem":[37],"defined":[38],"by":[39,110],"taking":[40],"union":[42],"optimal":[44],"matchings":[45],"across":[46],"various":[47],"slightly":[48],"modified":[49],"versions":[50],"base":[53,94],"graph:":[54],"$H_{\\mathcal{J}}(G)=\\bigcup_{U":[55],"\\in":[56],"\\mathcal{J}}":[57],"M_{\\star}(G_{U})$.":[58],"establish":[60],"two":[61,67,202],"families":[62],"results:":[64],"(1)":[65],"In":[66,100,205],"distinct":[68],"settings":[69],"for":[70,117,126,143,182],"Assignment":[72,169],"Problem,":[73],"we":[74,123,152,179],"prove":[75],"that":[76,125,181],"resulting":[78],"graphs":[79,86,95],"$H_{\\mathcal{J}}$,":[80],"as":[81,83,190,228],"well":[82],"certain":[84],"associated":[85,146],"$\\bar{H}_{\\mathcal{J}}$,":[87],"are":[88,108,173,187,225],"spanning":[89],"trees":[90,185],"on":[91,175,209,217],"relevant":[93],"and":[97,196,216],"$\\bar{G}$.":[98],"(2)":[99],"these":[101],"same":[102],"settings,":[103],"assuming":[104],"weights":[107],"$p$-th":[112],"power":[113],"Euclidean":[115,168],"distances":[116],"point":[118],"configurations":[119],"plane,":[122],"show":[124],"$p=1$":[127],"tree":[129,147,211],"$H_{\\mathcal{J}}$":[130],"non-crossing":[132],"(i.e.,":[133],"its":[134,218],"planar":[135,177,219],"embedding":[136],"has":[137],"no":[138],"crossing":[139],"edges),":[140],"whereas,":[141],"remarkably,":[142],"$p=2$":[144,183],"$\\bar{H}_{\\mathcal{J}}$":[148,186],"non-crossing.":[150],"Finally,":[151],"introduce":[153],"novel":[154],"conjectures":[155],"Statistical":[157],"Mechanics,":[158],"be":[160],"explored":[161],"future":[163],"work:":[164],"Random":[167],"Problem":[170],"(where":[171],"points":[172],"i.i.d.\\":[174],"domain),":[178],"conjecture":[180],"asymptotically":[188,226],"distributed":[189,227],"Uniform":[191],"Spanning":[192],"Trees":[193],"with":[194,230],"free":[195],"wired":[197],"boundary":[198],"conditions":[199],"respective":[203],"settings.":[204],"particular,":[206],"suitable":[207],"paths":[208],"second":[214],"setting,":[215,224],"dual":[220],"first":[223],"$\\text{SLE}_\u03ba$":[229],"$\u03ba=2$.":[231]},"counts_by_year":[],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2026-08-26T00:00:00"}