{"id":"https://openalex.org/W4383224201","doi":"https://doi.org/10.1017/s0963548323000196","title":"The codegree Tur\u00e1n density of tight cycles minus one edge","display_name":"The codegree Tur\u00e1n density of tight cycles minus one edge","publication_year":2023,"publication_date":"2023-07-05","ids":{"openalex":"https://openalex.org/W4383224201","doi":"https://doi.org/10.1017/s0963548323000196"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548323000196","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3D058F73B8050A7B96E1BEC53E4253A4/S0963548323000196a.pdf/div-class-title-the-codegree-turan-density-of-tight-cycles-minus-one-edge-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3D058F73B8050A7B96E1BEC53E4253A4/S0963548323000196a.pdf/div-class-title-the-codegree-turan-density-of-tight-cycles-minus-one-edge-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049432338","display_name":"Sim\u00f3n Piga","orcid":"https://orcid.org/0000-0003-4451-7821"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Sim\u00f3n Piga","raw_affiliation_strings":["School of Mathematics, University of Birmingham, Birmingham, UK,"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Birmingham, UK,","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023828026","display_name":"Marcelo Tadeu Sales","orcid":"https://orcid.org/0000-0001-7561-8073"},"institutions":[{"id":"https://openalex.org/I150468666","display_name":"Emory University","ror":"https://ror.org/03czfpz43","country_code":"US","type":"education","lineage":["https://openalex.org/I150468666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marcelo Sales","raw_affiliation_strings":["Mathematics Department, Emory University, Atlanta, GA, USA, and"],"affiliations":[{"raw_affiliation_string":"Mathematics Department, Emory University, Atlanta, GA, USA, and","institution_ids":["https://openalex.org/I150468666"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059965097","display_name":"Bjarne Sch\u00fclke","orcid":"https://orcid.org/0000-0003-1621-4030"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bjarne Sch\u00fclke","raw_affiliation_strings":["Mathematics Department, California Institute of Technology, Pasadena, CA, USA"],"affiliations":[{"raw_affiliation_string":"Mathematics Department, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049432338"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":1.158,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":2,"citation_normalized_percentile":{"value":0.643546,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":78,"max":84},"biblio":{"volume":"32","issue":"6","first_page":"881","last_page":"884"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9999,"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.9999,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9937,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9875,"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/hypergraph","display_name":"Hypergraph","score":0.7308423}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.82120776},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7308423},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7268287},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6642581},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.63422143},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08217931},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.033677638},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548323000196","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3D058F73B8050A7B96E1BEC53E4253A4/S0963548323000196a.pdf/div-class-title-the-codegree-turan-density-of-tight-cycles-minus-one-edge-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548323000196","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3D058F73B8050A7B96E1BEC53E4253A4/S0963548323000196a.pdf/div-class-title-the-codegree-turan-density-of-tight-cycles-minus-one-edge-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":9,"referenced_works":["https://openalex.org/W1488705378","https://openalex.org/W1919563699","https://openalex.org/W1979723321","https://openalex.org/W2029416152","https://openalex.org/W2055691364","https://openalex.org/W2110354774","https://openalex.org/W2272077246","https://openalex.org/W2498848698","https://openalex.org/W2742569245"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W4300037846","https://openalex.org/W3138003926","https://openalex.org/W3094179932","https://openalex.org/W3005801850","https://openalex.org/W2963081352","https://openalex.org/W2950595062","https://openalex.org/W2472555608","https://openalex.org/W1630514295","https://openalex.org/W1537073411"],"abstract_inverted_index":{"Abstract":[0],"Given":[1],"$\\alpha":[2,35],"\\gt":[3],"0$":[4],"and":[5,62],"an":[6],"integer":[7],"$\\ell":[8],"\\geq":[9],"5$":[10],",":[11,44],"we":[12],"prove":[13],"that":[14],"every":[15,27],"sufficiently":[16],"large":[17],"$3$":[18],"-uniform":[19],"hypergraph":[20],"$H$":[21],"on":[22,48],"$n$":[23],"vertices":[24,29,50],"in":[25,32],"which":[26],"two":[28],"are":[30],"contained":[31],"at":[33],"least":[34],"n$":[36],"edges":[37],"contains":[38],"a":[39,45,56],"copy":[40],"of":[41],"$C_\\ell":[42],"^{-}$":[43],"tight":[46],"cycle":[47],"$\\ell$":[49],"minus":[51],"one":[52],"edge.":[53],"This":[54],"improves":[55],"previous":[57],"result":[58],"by":[59],"Balogh,":[60],"Clemen,":[61],"Lidick\u00fd.":[63]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4383224201","counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-01-02T14:19:41.235973","created_date":"2023-07-06"}