{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T15:26:20Z","timestamp":1775834780502,"version":"3.50.1"},"reference-count":20,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T00:00:00Z","timestamp":1214870400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2008,7]]},"abstract":"<jats:p>For a fixed \u03c1 \u2208 [0, 1], what is (asymptotically) the minimal possible density g<jats:sub>3<\/jats:sub>(\u03c1) of triangles in a graph with edge density \u03c1? We completely solve this problem by proving that<jats:disp-formula><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S0963548308009085_eqnU1\"\/><\/jats:disp-formula>where<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S0963548308009085_inline1\"><jats:alt-text>$t\\df \\lfloor 1\/(1-\\rho)\\rfloor$<\/jats:alt-text><\/jats:inline-graphic>is the integer such that<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S0963548308009085_inline2\"><jats:alt-text>$\\rho\\in\\bigl[ 1-\\frac 1t,1-\\frac 1{t+1}\\bigr]$<\/jats:alt-text><\/jats:inline-graphic>.<\/jats:p>","DOI":"10.1017\/s0963548308009085","type":"journal-article","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T09:08:39Z","timestamp":1211533719000},"page":"603-618","source":"Crossref","is-referenced-by-count":116,"title":["On the Minimal Density of Triangles in Graphs"],"prefix":"10.1017","volume":"17","author":[{"given":"ALEXANDER A.","family":"RAZBOROV","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2008,7,1]]},"reference":[{"key":"S0963548308009085_ref2","doi-asserted-by":"crossref","unstructured":"[2] Bollob\u00e1s B. (1978) Extremal Graph Theory, Academic Press.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"S0963548308009085_ref9","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130411"},{"key":"S0963548308009085_ref20","first-page":"436","article-title":"Egy gr\u00e1felm\u00e9leti sz\u00e9ls\u00f6\u00e9rt\u00e9kfeladatr\u00f3l","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. \u00e9s Fiz. Lapok"},{"key":"S0963548308009085_ref13","doi-asserted-by":"crossref","unstructured":"[13] Lov\u00e1sz L. and Simonovits M. (1983) On the number of complete subgraphs of a graph II. In Studies in Pure Mathematics, Birkh\u00e4user, pp. 459\u2013495.","DOI":"10.1007\/978-3-0348-5438-2_41"},{"key":"S0963548308009085_ref8","unstructured":"[8] Felix D. (2005) Asymptotic relations in flag algebras. Manuscript, available at http:\/\/math.ucsd.edu\/~dfelix\/partialorder.pdf."},{"key":"S0963548308009085_ref14","first-page":"60","article-title":"Problem 28: Solution by H. Gouwentak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W. A. Wythoff","volume":"10","author":"Mantel","year":"1907","journal-title":"Wiskundige Opgaven"},{"key":"S0963548308009085_ref4","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1215\/ijm\/1255631811","article-title":"On a theorem of Rademacher\u2013Tur\u00e1n","volume":"6","author":"Erd\u0151s","year":"1962","journal-title":"Illinois J. Math."},{"key":"S0963548308009085_ref5","doi-asserted-by":"crossref","first-page":"290","DOI":"10.21136\/CPM.1969.108598","article-title":"On the number of complete subgraphs contained in certain graphs","volume":"94","author":"Erd\u0151s","year":"1969","journal-title":"Casopis Pest. Mat."},{"key":"S0963548308009085_ref1","unstructured":"[1] Bollob\u00e1s B. (1975) Relations between sets of complete subgraphs. In Proc. Fifth British Combin. Conference, pp. 79\u201384."},{"key":"S0963548308009085_ref17","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1963-004-7"},{"key":"S0963548308009085_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579292"},{"key":"S0963548308009085_ref19","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1203350785"},{"key":"S0963548308009085_ref12","first-page":"344","article-title":"The Nordhaus\u2013Stewart\u2013Moon\u2013Moser inequality","volume":"4","author":"Khad\u017eiivanov","year":"1978","journal-title":"Serdica"},{"key":"S0963548308009085_ref3","unstructured":"[3] Borgs C. , Chayes J. , Lov\u00e1sz L. , S\u00f3s V. T. and Vesztergombi K. (2006) Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing. Manuscript, available at http:\/\/arxiv.org\/abs\/math\/0702004."},{"key":"S0963548308009085_ref11","doi-asserted-by":"publisher","DOI":"10.2307\/2310464"},{"key":"S0963548308009085_ref15","first-page":"283","article-title":"On a problem of Tur\u00e1n","volume":"7","author":"Moon","year":"1962","journal-title":"Magyar. Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"key":"S0963548308009085_ref18","unstructured":"[18] Podolskii V. V. (2006) Master's thesis, Moscow State University, Moscow. In Russian."},{"key":"S0963548308009085_ref16","unstructured":"[16] Nikiforov V. (2007) The number of cliques in graphs of given order and size. Manuscript, available at http:\/\/arxiv.org\/abs\/0710.2305v2 (version 2)."},{"key":"S0963548308009085_ref6","unstructured":"[6] Erd\u0151s P. and Spencer J. (1974) Probabilistic Methods in Combinatorics, Academic Press."},{"key":"S0963548308009085_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00086-7"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548308009085","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T02:53:53Z","timestamp":1631328833000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548308009085\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["S0963548308009085"],"URL":"https:\/\/doi.org\/10.1017\/s0963548308009085","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7]]}}}