{"id":"https://openalex.org/W3199264733","doi":"https://doi.org/10.37236/9670","title":"Sharp Minimum Degree Conditions for the Existence of Disjoint Theta Graphs","display_name":"Sharp Minimum Degree Conditions for the Existence of Disjoint Theta Graphs","publication_year":2021,"publication_date":"2021-09-10","ids":{"openalex":"https://openalex.org/W3199264733","doi":"https://doi.org/10.37236/9670","mag":"3199264733"},"language":"en","primary_location":{"id":"doi:10.37236/9670","is_oa":true,"landing_page_url":"https://doi.org/10.37236/9670","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v28i3p50/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/v28i3p50/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100419890","display_name":"Emily A. Marshall","orcid":"https://orcid.org/0000-0003-4463-2256"},"institutions":[{"id":"https://openalex.org/I4210104968","display_name":"Arcadia","ror":"https://ror.org/01km6z968","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210104968"]},{"id":"https://openalex.org/I51204116","display_name":"Arcadia University","ror":"https://ror.org/00ff4bt20","country_code":"US","type":"education","lineage":["https://openalex.org/I51204116"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emily Marshall","raw_affiliation_strings":["Arcadia University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arcadia University","institution_ids":["https://openalex.org/I4210104968","https://openalex.org/I51204116"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082173943","display_name":"Michael Santana","orcid":"https://orcid.org/0000-0003-2299-6964"},"institutions":[{"id":"https://openalex.org/I8606887","display_name":"Grand Valley State University","ror":"https://ror.org/001m1hv61","country_code":"US","type":"education","lineage":["https://openalex.org/I8606887"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Santana","raw_affiliation_strings":["Grand Valley State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Grand Valley State University","institution_ids":["https://openalex.org/I8606887"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28424864,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"3","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.9997000098228455,"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.9997000098228455,"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.9983000159263611,"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/T11476","display_name":"Graph theory and applications","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/combinatorics","display_name":"Combinatorics","score":0.8920308351516724},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.8500548601150513},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7747915983200073},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.7036534547805786},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5917748212814331},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.509678840637207},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3486570715904236},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.188867449760437}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8920308351516724},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8500548601150513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7747915983200073},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7036534547805786},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5917748212814331},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.509678840637207},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3486570715904236},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.188867449760437},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/9670","is_oa":true,"landing_page_url":"https://doi.org/10.37236/9670","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v28i3p50/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/9670","is_oa":true,"landing_page_url":"https://doi.org/10.37236/9670","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v28i3p50/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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3199264733.pdf","grobid_xml":"https://content.openalex.org/works/W3199264733.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W2001686801","https://openalex.org/W2034156419","https://openalex.org/W2035570915","https://openalex.org/W2056485055","https://openalex.org/W2094126876","https://openalex.org/W2322791807","https://openalex.org/W3005139504","https://openalex.org/W6722174013"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W3161230432","https://openalex.org/W2138685729","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W1553466895"],"abstract_inverted_index":{"In":[0,48],"1963,":[1],"Corr\u00e1di":[2],"and":[3,17,65,75,90,145,173,177],"Hajnal":[4],"showed":[5,69],"that":[6,70],"if":[7,71,82,141],"$G$":[8,22,96,151],"is":[9,31,84,129,164],"an":[10,54],"$n$-vertex":[11],"graph":[12],"with":[13,86],"$n":[14,72,142,170],"\\ge":[15,19,77,92,143,147],"3k$":[16],"$\\delta(G)":[18,76,91,146],"2k$,":[20],"then":[21,95,150],"will":[23],"contain":[24],"$k$":[25,89,98,153],"disjoint":[26,99,154],"cycles;":[27],"furthermore,":[28],"this":[29,49,57,118,135,138,160],"result":[30,58,133],"best":[32],"possible,":[33],"both":[34,108],"in":[35,107,122,134],"terms":[36],"of":[37,40,56,115],"the":[38,45,103,113,179],"number":[39,114],"vertices":[41,116],"as":[42,44],"well":[43],"minimum":[46,104,126,161,181],"degree.":[47],"paper":[50,136],"we":[51,158,174],"focus":[52],"on":[53],"analogue":[55],"for":[59,112,166],"theta":[60,100,155],"graphs.":[61,101,156],"Results":[62],"from":[63,186],"Kawarabayashi":[64],"Chiba":[66],"et":[67],"al.":[68],"=":[73,171],"4k$":[74,144],"\\lceil":[78,148],"\\frac{5}{2}k":[79],"\\rceil$,":[80],"or":[81],"$n$":[83],"large":[85],"respect":[87],"to":[88,189],"2k+1$,":[93],"respectively,":[94],"contains":[97,152],"While":[102],"degree":[105,127,162,182],"condition":[106,128,163,183],"results":[109],"are":[110],"sharp":[111,165,180],"considered,":[117],"leaves":[119],"a":[120],"gap":[121],"which":[123],"no":[124],"sufficient":[125],"known.":[130],"Our":[131],"main":[132],"resolves":[137],"by":[139],"showing":[140],"\\frac{5}{2}k\\rceil$,":[149],"Furthermore,":[157],"show":[159],"more":[167],"than":[168],"just":[169],"4k$,":[172],"discuss":[175],"how":[176],"when":[178],"may":[184],"transition":[185],"$\\lceil":[187],"\\frac{5}{2}k\\rceil$":[188],"$2k+1$.":[190]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}