{"id":"https://openalex.org/W1975998435","doi":"https://doi.org/10.1007/s004930100028","title":"The Erd\u0151s-P\u00f3sa Property for Odd Cycles in Graphs of Large Connectivity","display_name":"The Erd\u0151s-P\u00f3sa Property for Odd Cycles in Graphs of Large Connectivity","publication_year":2001,"publication_date":"2001-04-01","ids":{"openalex":"https://openalex.org/W1975998435","doi":"https://doi.org/10.1007/s004930100028","mag":"1975998435"},"language":"en","primary_location":{"id":"doi:10.1007/s004930100028","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004930100028","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062275812","display_name":"Carsten Thomassen","orcid":"https://orcid.org/0000-0003-0670-4079"},"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":"Carsten Thomassen","raw_affiliation_strings":["Department of Mathematics, Technical University of Denmark; Lyngby, Denmark;","Department of Mathematics, Technical University of Denmark","Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technical University of Denmark; Lyngby, Denmark;","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Department of Mathematics, Technical University of Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Lyngby, Denmark","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062275812"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":0.457,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.6392865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"21","issue":"2","first_page":"321","last_page":"333"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9961000084877014,"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/combinatorics","display_name":"Combinatorics","score":0.8878604769706726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7598754167556763},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5354300737380981},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49266916513442993},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.4515600800514221},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.44328880310058594},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4318177103996277},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.42704153060913086},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.412204772233963},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.3030417263507843},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17828860878944397},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09538933634757996}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8878604769706726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7598754167556763},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5354300737380981},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49266916513442993},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.4515600800514221},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.44328880310058594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4318177103996277},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.42704153060913086},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.412204772233963},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.3030417263507843},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17828860878944397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09538933634757996},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s004930100028","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004930100028","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/14b09336-927a-44b8-8a07-9459d419bc5d","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/14b09336-927a-44b8-8a07-9459d419bc5d","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Thomassen , C 2001 , ' The Erdos-Posa property for odd cycles in graphs of large connectivity ' , Combinatorica , vol. 21 , no. 2 , pp. 321-333 . https://doi.org/10.1007/s004930100028","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1516768651","https://openalex.org/W2005079828","https://openalex.org/W2019067855","https://openalex.org/W2054740829","https://openalex.org/W2065300109","https://openalex.org/W2076192760","https://openalex.org/W2096113666","https://openalex.org/W2332112754"],"related_works":["https://openalex.org/W2982283786","https://openalex.org/W4288436438","https://openalex.org/W4298388358","https://openalex.org/W2039832814","https://openalex.org/W2414388691","https://openalex.org/W2557495118","https://openalex.org/W2090130267","https://openalex.org/W2992957516","https://openalex.org/W3185928135","https://openalex.org/W2222825498"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}