{"id":"https://openalex.org/W2039853098","doi":"https://doi.org/10.1007/s00373-012-1212-9","title":"A Note on Tur\u00e1n Numbers for Even Wheels","display_name":"A Note on Tur\u00e1n Numbers for Even Wheels","publication_year":2012,"publication_date":"2012-08-07","ids":{"openalex":"https://openalex.org/W2039853098","doi":"https://doi.org/10.1007/s00373-012-1212-9","mag":"2039853098"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-012-1212-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00373-012-1212-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00373-012-1212-9.pdf","source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00373-012-1212-9.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043423165","display_name":"Tomasz Dzido","orcid":"https://orcid.org/0000-0001-6712-8541"},"institutions":[{"id":"https://openalex.org/I40413290","display_name":"University of Gda\u0144sk","ror":"https://ror.org/011dv8m48","country_code":"PL","type":"education","lineage":["https://openalex.org/I40413290"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Tomasz Dzido","raw_affiliation_strings":["Institute of Informatics, University of Gda\u0144sk, Gda\u0144sk, Poland","Institute of Informatics, University of Gda\u0144sk, Gda\u0144sk, Poland 80-952#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Gda\u0144sk, Gda\u0144sk, Poland","institution_ids":["https://openalex.org/I40413290"]},{"raw_affiliation_string":"Institute of Informatics, University of Gda\u0144sk, Gda\u0144sk, Poland 80-952#TAB#","institution_ids":["https://openalex.org/I40413290"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043423165"],"corresponding_institution_ids":["https://openalex.org/I40413290"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.8665,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.67990414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"5","first_page":"1305","last_page":"1309"},"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":1.0,"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":1.0,"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.9994999766349792,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9965000152587891,"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/mathematics","display_name":"Mathematics","score":0.8581475019454956},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8471362590789795},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5182664394378662},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4860537350177765},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4066580832004547}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8581475019454956},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8471362590789795},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5182664394378662},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4860537350177765},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4066580832004547}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00373-012-1212-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00373-012-1212-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00373-012-1212-9.pdf","source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00373-012-1212-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00373-012-1212-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00373-012-1212-9.pdf","source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2039853098.pdf","grobid_xml":"https://content.openalex.org/works/W2039853098.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W788200807","https://openalex.org/W1484040084","https://openalex.org/W1604945782","https://openalex.org/W2013821800","https://openalex.org/W2082270016"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"The":[0],"Tur\u00e1n":[1,50,75],"number":[2,8,76],"ex(n,":[3,77],"G)":[4],"is":[5],"the":[6,31,58,71],"maximum":[7],"of":[9,30,37],"edges":[10],"in":[11],"any":[12],"n-vertex":[13],"graph":[14],"that":[15,95],"does":[16],"not":[17],"contain":[18],"a":[19,26,62],"subgraph":[20],"isomorphic":[21],"to":[22,108],"G.":[23],"We":[24,69],"consider":[25],"very":[27],"special":[28],"case":[29],"Simonovits\u2019s":[32],"theorem":[33],"(Simonovits":[34],"in:":[35],"Theory":[36],"graphs,":[38],"Academic":[39],"Press,":[40],"New":[41],"York,":[42],"1968)":[43],"which":[44],"determine":[45],"an":[46],"asymptotic":[47],"result":[48,65],"for":[49,52,66,74,81,98],"numbers":[51,104],"graphs":[53],"with":[54],"some":[55,110],"properties.":[56],"In":[57,91],"paper":[59],"we":[60,93],"present":[61],"more":[63],"precise":[64],"even":[67],"wheels.":[68],"provide":[70],"exact":[72],"value":[73],"W":[78],"2k":[79],")":[80],"n":[82,100],"\u2265":[83,89,101],"6k":[84],"\u2212":[85],"10":[86],"and":[87],"k":[88],"3.":[90],"addition,":[92],"show":[94],"$${ex(n,W_6)=":[96],"\\lfloor\\frac{n^2}{3}\\rfloor}$$":[97],"all":[99],"6.":[102],"These":[103],"can":[105],"be":[106],"useful":[107],"calculate":[109],"Ramsey":[111],"numbers.":[112]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}