{"id":"https://openalex.org/W2768945250","doi":"https://doi.org/10.37236/7152","title":"A Cycle of Maximum Order in a Graph of High Minimum Degree has a Chord","display_name":"A Cycle of Maximum Order in a Graph of High Minimum Degree has a Chord","publication_year":2017,"publication_date":"2017-11-24","ids":{"openalex":"https://openalex.org/W2768945250","doi":"https://doi.org/10.37236/7152","mag":"2768945250"},"language":"en","primary_location":{"id":"doi:10.37236/7152","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7152","pdf_url":null,"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://doi.org/10.37236/7152","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018558486","display_name":"Daniel J. Harvey","orcid":null},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Daniel J. Harvey","raw_affiliation_strings":["DTU Compute\r\nDepartment of Applied Mathematics and Computer Science\r\nTechnical University of Denmark\r\nLyngby, Denmark","DTU Compute\nDepartment of Applied Mathematics and Computer Science\nTechnical University of Denmark\nLyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"DTU Compute\r\nDepartment of Applied Mathematics and Computer Science\r\nTechnical University of Denmark\r\nLyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"DTU Compute\nDepartment of Applied Mathematics and Computer Science\nTechnical University of Denmark\nLyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018558486"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.20002342,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"24","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T11567","display_name":"semigroups and automata theory","score":0.9904999732971191,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9843999743461609,"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/chord","display_name":"Chord (peer-to-peer)","score":0.676791787147522},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6585135459899902},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.603042483329773},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5343446135520935},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46195223927497864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27204665541648865},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.14512008428573608}],"concepts":[{"id":"https://openalex.org/C194147245","wikidata":"https://www.wikidata.org/wiki/Q1076368","display_name":"Chord (peer-to-peer)","level":2,"score":0.676791787147522},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6585135459899902},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.603042483329773},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5343446135520935},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46195223927497864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27204665541648865},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.14512008428573608},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/7152","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7152","pdf_url":null,"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"},{"id":"pmh:oai:pure.atira.dk:publications/b3906b76-022b-4ad4-a524-de32c113f232","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/b3906b76-022b-4ad4-a524-de32c113f232","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Harvey , D J 2017 , ' A Cycle of Maximum Order in a Graph of High Minimum Degree has a Chord ' , The Electronic Journal of Combinatorics , vol. 24 , no. 4 , P4.33 .","raw_type":"article"}],"best_oa_location":{"id":"doi:10.37236/7152","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7152","pdf_url":null,"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":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W229552792","https://openalex.org/W1979597421","https://openalex.org/W2351864507","https://openalex.org/W2007980826","https://openalex.org/W3215212221","https://openalex.org/W2070360846","https://openalex.org/W2042398445","https://openalex.org/W2061531152","https://openalex.org/W3002753104"],"abstract_inverted_index":{"A":[0],"well-known":[1],"conjecture":[2,25,30,55],"of":[3,9,48,67,73,94,101],"Thomassen":[4],"states":[5],"that":[6,58,83],"every":[7],"cycle":[8,97],"maximum":[10],"order":[11,93,100],"in":[12,57],"a":[13,17,39,43,64,78,88],"$3$-connected":[14],"graph":[15],"contains":[16],"chord.":[18],"While":[19],"many":[20],"partial":[21],"results":[22],"towards":[23],"this":[24,35],"have":[26],"been":[27],"obtained,":[28],"the":[29,71,92,95,99,102],"itself":[31],"remains":[32],"unsolved.":[33],"In":[34,70],"paper,":[36],"we":[37,76],"prove":[38,77],"stronger":[40],"result":[41,61,81],"without":[42],"connectivity":[44],"assumption":[45],"for":[46],"graphs":[47],"high":[49],"minimum":[50,85],"degree,":[51],"which":[52],"shows":[53],"Thomassen's":[54],"holds":[56],"case.":[59],"This":[60],"is":[62],"within":[63],"constant":[65],"factor":[66],"best":[68],"possible.":[69],"process":[72],"proving":[74],"this,":[75],"more":[79],"general":[80],"showing":[82],"large":[84,89],"degree":[86],"forces":[87],"difference":[90],"between":[91],"largest":[96,103],"and":[98],"chordless":[104],"cycle.":[105]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}