{"id":"https://openalex.org/W2962721321","doi":"https://doi.org/10.1137/18m1163956","title":"Codegree Tur\u00e1n Density of Complete $r$-Uniform Hypergraphs","display_name":"Codegree Tur\u00e1n Density of Complete $r$-Uniform Hypergraphs","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2962721321","doi":"https://doi.org/10.1137/18m1163956","mag":"2962721321"},"language":"en","primary_location":{"id":"doi:10.1137/18m1163956","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1163956","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.birmingham.ac.uk/en/publications/352b2e89-2141-4b51-bcaa-86d700aeeda6","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022659483","display_name":"Allan Lo","orcid":"https://orcid.org/0000-0001-9767-2863"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Allan Lo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5006385137","display_name":"Yi Zhao","orcid":"https://orcid.org/0000-0002-1152-1229"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yi Zhao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6076,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.82422259,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"32","issue":"2","first_page":"1154","last_page":"1158"},"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.9998999834060669,"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.9998999834060669,"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.9925000071525574,"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/T11797","display_name":"graph theory and CDMA systems","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8886034488677979},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7876819968223572},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6608459949493408},{"id":"https://openalex.org/keywords/independence-number","display_name":"Independence number","score":0.5659058690071106},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4372135400772095},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3317450284957886}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8886034488677979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7876819968223572},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6608459949493408},{"id":"https://openalex.org/C2984853995","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independence number","level":3,"score":0.5659058690071106},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4372135400772095},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3317450284957886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/18m1163956","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1163956","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/352b2e89-2141-4b51-bcaa-86d700aeeda6","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/352b2e89-2141-4b51-bcaa-86d700aeeda6","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lo, A & Zhao, Y 2018, 'Codegree Tur\u00e1n density of complete $r$-uniform hypergraphs', SIAM Journal on Discrete Mathematics, vol. 32, no. 2, pp. 1154-1158. https://doi.org/10.1137/18M1163956","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:publications/352b2e89-2141-4b51-bcaa-86d700aeeda6","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/codegree-turn-density-of-complete-runiform-hypergraphs(352b2e89-2141-4b51-bcaa-86d700aeeda6).html","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/48620675/codegKt_submitted_revised.pdf","source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"Lo, A & Zhao, Y 2018, 'Codegree Tur\u00e1n density of complete $r$-uniform hypergraphs', SIAM Journal on Discrete Mathematics, vol. 32, no. 2, pp. 1154-1158. https://doi.org/10.1137/18M1163956","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:Publications/352b2e89-2141-4b51-bcaa-86d700aeeda6","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/352b2e89-2141-4b51-bcaa-86d700aeeda6","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/352b2e89-2141-4b51-bcaa-86d700aeeda6","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lo, A & Zhao, Y 2018, 'Codegree Tur\u00e1n density of complete $r$-uniform hypergraphs', SIAM Journal on Discrete Mathematics, vol. 32, no. 2, pp. 1154-1158. https://doi.org/10.1137/18M1163956","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2022013667","display_name":"A graph theoretical approach for combinatorial designs","funder_award_id":"EP/P002420/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3941445231","display_name":"Extremal Combinatorics under Degree Conditions","funder_award_id":"1700622","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7855462740","display_name":null,"funder_award_id":"DMS-1400073","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8514069245","display_name":null,"funder_award_id":"EP/P002420/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1919563699","https://openalex.org/W1986878159","https://openalex.org/W2029416152","https://openalex.org/W2055691364","https://openalex.org/W2085160038","https://openalex.org/W2090323026","https://openalex.org/W2102272303","https://openalex.org/W2742569245","https://openalex.org/W4256532737"],"related_works":["https://openalex.org/W1978042415","https://openalex.org/W4295189428","https://openalex.org/W2766144424","https://openalex.org/W4283120775","https://openalex.org/W2793745936","https://openalex.org/W2792261379","https://openalex.org/W2890393729","https://openalex.org/W2607245078","https://openalex.org/W3099717275","https://openalex.org/W3206162751"],"abstract_inverted_index":{"Let":[0],"$r\\ge":[1],"3$.":[2],"Given":[3,31],"an":[4,32],"$r$-graph":[5,33,48,102],"$H$,":[6],"the":[7,12,35,41,65,100,108],"minimum":[8],"codegree":[9,36],"$\\delta_{r-1}(H)$":[10],"is":[11,22,40,99],"largest":[13],"integer":[14],"$t$":[15,27,104],"such":[16,45,82],"that":[17,46,72,83],"every":[18,47],"$(r-1)$-subset":[19],"of":[20,29,68],"$V(H)$":[21],"contained":[23],"in":[24],"at":[25],"least":[26],"edges":[28],"$H$.":[30],"$F$,":[34],"Tur\u00e1n":[37],"density":[38],"$\\gamma(F)$":[39],"smallest":[42],"$\\gamma":[43],">0$":[44],"on":[49,64,80,103],"$n$":[50],"vertices":[51],"with":[52],"$\\delta_{r-1}(H)\\ge":[53],"(\\gamma":[54],"+":[55],"o(1))n$":[56],"contains":[57],"$F$":[58],"as":[59],"a":[60],"subhypergraph.":[61],"Using":[62],"results":[63],"independence":[66],"number":[67],"hypergraphs,":[69],"we":[70],"show":[71],"there":[73],"are":[74],"constants":[75],"$c_1,":[76],"c_2>0$":[77],"depending":[78],"only":[79],"$r$":[81],"$1":[84],"-":[85,93],"c_2":[86],"\\tfrac{\\ln":[87,95],"t}{t^{r-1}}":[88],"\\le":[89,91],"\\gamma(K_t^r)":[90],"1":[92],"c_1":[94],"t}{t^{r-1}},$":[96],"where":[97],"$K_t^r$":[98],"complete":[101],"vertices.":[105],"This":[106],"gives":[107],"best":[109],"general":[110],"bounds":[111],"for":[112],"$\\gamma(K_t^r)$.":[113]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
