{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:38:16Z","timestamp":1761896296935},"reference-count":39,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2016,5,4]],"date-time":"2016-05-04T00:00:00Z","timestamp":1462320000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2017,1]]},"abstract":"<jats:p>We consider the problem of minimizing the number of triangles in a graph of given order and size, and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that minimize the triangle density.<\/jats:p>","DOI":"10.1017\/s0963548316000110","type":"journal-article","created":{"date-parts":[[2016,5,4]],"date-time":"2016-05-04T06:34:57Z","timestamp":1462343697000},"page":"138-160","source":"Crossref","is-referenced-by-count":20,"title":["Asymptotic Structure of Graphs with the Minimum Number of Triangles"],"prefix":"10.1017","volume":"26","author":[{"given":"OLEG","family":"PIKHURKO","sequence":"first","affiliation":[]},{"given":"ALEXANDER","family":"RAZBOROV","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2016,5,4]]},"reference":[{"key":"S0963548316000110_ref25","first-page":"60","article-title":"Problem 28","volume":"10","author":"Mantel","year":"1907","journal-title":"Winkundige Opgaven"},{"key":"S0963548316000110_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S0021900200009918"},{"key":"S0963548316000110_ref23","unstructured":"Lubetzky E. and Zhao Y. (2014) On the variational problem for upper tails in sparse random graphs. arXiv:1402.6011"},{"key":"S0963548316000110_ref27","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-2010-05189-X"},{"key":"S0963548316000110_ref38","unstructured":"Simonovits M. (1968) A method for solving extremal problems in graph theory, stability problems. In Theory of Graphs: Tihany 1966, Academic, pp. 279\u2013319."},{"key":"S0963548316000110_ref21","doi-asserted-by":"crossref","unstructured":"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":"S0963548316000110_ref30","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548313000357"},{"key":"S0963548316000110_ref18","unstructured":"Koml\u00f3s J. and Simonovits M. (1996) Szemer\u00e9di's regularity lemma and its applications to graph theory. In Combinatorics: Paul Erd\u0151s is Eighty ( D. Mikl\u00f3s , V. T. S\u00f3s and T. Sz\u0151nyi , eds), Vol. 2, Bolyai Mathematical Society, pp. 295\u2013352."},{"key":"S0963548316000110_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100052063"},{"key":"S0963548316000110_ref13","doi-asserted-by":"crossref","first-page":"290","DOI":"10.21136\/CPM.1969.108598","article-title":"On the number of complete subgraphs and circuits contained in graphs","volume":"94","author":"Erd\u0151s","year":"1969","journal-title":"\u010casopis P\u011bst. Mat."},{"key":"S0963548316000110_ref28","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1963-004-7"},{"key":"S0963548316000110_ref24","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20536"},{"key":"S0963548316000110_ref31","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/46\/30\/305002"},{"key":"S0963548316000110_ref15","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130411"},{"key":"S0963548316000110_ref35","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548308009085"},{"key":"S0963548316000110_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2011.03.014"},{"key":"S0963548316000110_ref12","unstructured":"Erd\u0151s P. (1967) Some recent results on extremal problems in graph theory: Results. In Theory of Graphs: Rome 1966, Gordon and Breach, pp. 117\u2013123 (English); pp. 124\u2013130 (French)."},{"key":"S0963548316000110_ref19","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/060"},{"key":"S0963548316000110_ref4","unstructured":"Chatterjee S. and Dembo A. (2014) Nonlinear large deviations. arXiv:1401.3495"},{"key":"S0963548316000110_ref10","first-page":"13","article-title":"Some theorems on graphs","volume":"9","author":"Erd\u0151s","year":"1955","journal-title":"Riveon Lematematika"},{"key":"S0963548316000110_ref5","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOP542"},{"key":"S0963548316000110_ref33","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/47\/17\/175001"},{"key":"S0963548316000110_ref37","first-page":"939","volume-title":"Combinatorics II","author":"Ruzsa","year":"1978"},{"key":"S0963548316000110_ref39","first-page":"436","article-title":"On an extremal problem in graph theory (in Hungarian)","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"},{"key":"S0963548316000110_ref32","doi-asserted-by":"publisher","DOI":"10.1214\/12-AAP907"},{"key":"S0963548316000110_ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2011.03.006"},{"key":"S0963548316000110_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.05.002"},{"key":"S0963548316000110_ref34","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1203350785"},{"key":"S0963548316000110_ref26","first-page":"283","article-title":"On a problem of Tur\u00e1n","volume":"7","author":"Moon","year":"1962","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"S0963548316000110_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2008.07.008"},{"key":"S0963548316000110_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2012.12.008"},{"key":"S0963548316000110_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2013.02.003"},{"key":"S0963548316000110_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788085"},{"key":"S0963548316000110_ref20","first-page":"431","article-title":"On the number of complete subgraphs of a graph","volume":"XV","author":"Lov\u00e1sz","year":"1976","journal-title":"Proc. 5th British Combinatorial Conference: Aberdeen 1975. Congress. Numer."},{"key":"S0963548316000110_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050052"},{"key":"S0963548316000110_ref6","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1155"},{"key":"S0963548316000110_ref11","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":"S0963548316000110_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2013.05.002"},{"key":"S0963548316000110_ref36","unstructured":"Reiher C. (2012) The clique density theorem. arXiv:1212.2454"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548316000110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T11:23:20Z","timestamp":1600514600000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548316000110\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,4]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["S0963548316000110"],"URL":"https:\/\/doi.org\/10.1017\/s0963548316000110","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,4]]}}}