{"id":"https://openalex.org/W7135172978","doi":"https://doi.org/10.37236/13538","title":"Positive Co-Degree Thresholds for Spanning Structures","display_name":"Positive Co-Degree Thresholds for Spanning Structures","publication_year":2026,"publication_date":"2026-03-13","ids":{"openalex":"https://openalex.org/W7135172978","doi":"https://doi.org/10.37236/13538"},"language":null,"primary_location":{"id":"doi:10.37236/13538","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13538","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p48/pdf","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":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p48/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129014814","display_name":"Anastasia Halfpap","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anastasia Halfpap","raw_affiliation_strings":["Iowa State University"],"affiliations":[{"raw_affiliation_string":"Iowa State University","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129032472","display_name":"Van Magnan","orcid":null},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Van Magnan","raw_affiliation_strings":["University of Vermont"],"affiliations":[{"raw_affiliation_string":"University of Vermont","institution_ids":["https://openalex.org/I111236770"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5129014814"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.70244716,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.6355999708175659,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.6355999708175659,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.23440000414848328,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.03929999843239784,"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/degree","display_name":"Degree (music)","score":0.4447999894618988},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.43380001187324524},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4104999899864197},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.36469998955726624},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.31200000643730164},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.31130000948905945}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8424999713897705},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6851000189781189},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4851999878883362},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4447999894618988},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.43380001187324524},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4104999899864197},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.36469998955726624},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.31200000643730164},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.31130000948905945},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.30070000886917114},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.28209999203681946}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/13538","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13538","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p48/pdf","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"}],"best_oa_location":{"id":"doi:10.37236/13538","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13538","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p48/pdf","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":[{"id":"https://openalex.org/G181690689","display_name":"FRG: Collaborative Research: Extremal Combinatorics and Flag Algebras","funder_award_id":"2152490","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332222","display_name":"University of Illinois at Urbana-Champaign","ror":"https://ror.org/047426m28"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7135172978.pdf","grobid_xml":"https://content.openalex.org/works/W7135172978.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"minimum":[1,54,62,86,100,122],"positive":[2,55,87,101,123],"co-degree":[3,56,88,102,124],"of":[4,24,34,45,61,69,76],"a":[5,19,58],"non-empty":[6],"$r$-graph":[7],"$H$,":[8,35],"denoted":[9],"$\\delta_{r-1}^+(H)$,":[10],"is":[11,27,38],"the":[12,74,85,99,121],"largest":[13],"integer":[14],"$k$":[15,43],"such":[16],"that":[17],"if":[18],"set":[20],"$S":[21],"\\subset":[22],"V(H)$":[23],"size":[25],"$r-1$":[26],"contained":[28,39],"in":[29,40,64,80,94,108],"at":[30,41],"least":[31,42],"one":[32],"$r$-edge":[33],"then":[36],"$S$":[37],"$r$-edges":[44],"$H$.":[46,81],"Motivated":[47],"by":[48],"several":[49],"recent":[50],"papers":[51],"which":[52,71],"study":[53],"as":[57],"reasonable":[59],"notion":[60],"degree":[63],"$r$-graphs,":[65,95],"we":[66,113],"consider":[67],"bounds":[68],"$\\delta_{r-1}^+(H)$":[70],"will":[72],"guarantee":[73],"existence":[75],"various":[77],"spanning":[78],"subgraphs":[79],"We":[82],"precisely":[83],"determine":[84,98,115],"threshold":[89,103,125],"for":[90,104,126],"Berge":[91],"Hamiltonian":[92,106],"cycles":[93,107],"and":[96],"asymptotically":[97],"loose":[105],"$3$-graphs.":[109],"For":[110],"all":[111],"$r$,":[112],"also":[114],"up":[116],"to":[117],"an":[118],"additive":[119],"constant":[120],"perfect":[127],"matchings.":[128]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2026-03-14T00:00:00"}