{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:04:29Z","timestamp":1787321069687,"version":"build-2736575974"},"reference-count":18,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1400073"],"award-info":[{"award-number":["DMS-1400073"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1700622"],"award-info":[{"award-number":["1700622"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P002420\/1"],"award-info":[{"award-number":["EP\/P002420\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Let $r\\ge 3$. Given an $r$-graph $H$, the minimum codegree $\\delta_{r-1}(H)$ is the largest integer $t$ such that every $(r-1)$-subset of $V(H)$ is contained in at least $t$ edges of $H$. Given an $r$-graph $F$, the codegree Tur\u00e1n density $\\gamma(F)$ is the smallest $\\gamma &gt;0$ such that every $r$-graph on $n$ vertices with $\\delta_{r-1}(H)\\ge (\\gamma + o(1))n$ contains $F$ as a subhypergraph. Using results on the independence number of hypergraphs, we show that there are constants $c_1, c_2&gt;0$ depending only on $r$ such that $1 - c_2 \\tfrac{\\ln t}{t^{r-1}} \\le \\gamma(K_t^r) \\le 1 - c_1 \\tfrac{\\ln t}{t^{r-1}},$ where $K_t^r$ is the complete $r$-graph on $t$ vertices. This gives the best general bounds for $\\gamma(K_t^r)$.<\/jats:p>","DOI":"10.1137\/18m1163956","type":"journal-article","created":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T12:08:40Z","timestamp":1527768520000},"page":"1154-1158","source":"Crossref","is-referenced-by-count":7,"title":["Codegree Tur\u00e1n Density of Complete $r$-Uniform Hypergraphs"],"prefix":"10.1137","volume":"32","author":[{"given":"Allan","family":"Lo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,5,31]]},"reference":[{"key":"atypb1","first-page":"5","volume":"16","author":"D","year":"1983","journal-title":"Ars Combin."},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2013.05.030"},{"key":"atypb3","first-page":"6","author":"Duke R. A.","year":"1993","journal-title":"(Poznan\u0301"},{"key":"atypb4","first-page":"20","author":"V","year":"2013","journal-title":"Electron. J. Combin."},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1137\/130926997"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2017.06.067"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"Z. Fu\u0308redi,\n                      Tura\u0301n type problems\n                      , in Surveys in Combinatorics, 1991 (Guildford, 1991), London Math. Soc. Lecture Note Ser. 166, Cambridge University Press, Cambridge, UK, 1991, pp. 253-300.","DOI":"10.1017\/CBO9780511666216.010"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20249"},{"key":"atypb9","doi-asserted-by":"crossref","unstructured":"P. Keevash,\n                      Hypergraph Tura\u0301n problems\n                      , in Surveys in Combinatorics 2011, London Math. Soc. Lecture Note Ser. 392, Cambridge University Press, Cambridge, UK, 2011, pp. 83-139.","DOI":"10.1017\/CBO9781139004114.004"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2007.01.004"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20453"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1137\/120895974"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.06.001"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2006.11.006"},{"key":"atypb15","doi-asserted-by":"crossref","unstructured":"V. Ro\u0308dl and E. S\u030cin\u030cajova\u0301,\n                      Note on independent sets in Steiner systems\n                      , in Proceedings of the Fifth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science (Poznan\u0301, 1991), Vol. 5, 1994, pp. 183-190.","DOI":"10.1002\/rsa.3240050117"},{"key":"atypb16","doi-asserted-by":"crossref","unstructured":"A. Sidorenko,\n                      Extremal Problems on the Hypercube and the Codegree Tura\u0301n Density of Complete $r$-Graphs\n                      ,arXiv:1710.08228, 2017.","DOI":"10.1137\/17M1151171"},{"key":"atypb17","first-page":"19","volume":"5","author":"Sidorenko A. F.","year":"1981","journal-title":"Vestnik Moskov. Univ. Ser. I Mat. Mekh."},{"key":"atypb18","first-page":"436","volume":"48","author":"Tura\u0301n P.","year":"1941","journal-title":"Mat. Fiz. Lapok"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/18M1163956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:05:52Z","timestamp":1787317552000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/18M1163956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/18M1163956"],"URL":"https:\/\/doi.org\/10.1137\/18m1163956","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}