{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T15:02:00Z","timestamp":1773068520380,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1016\/j.jcta.2016.09.003","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T22:07:46Z","timestamp":1479766066000},"page":"312-343","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"special_numbering":"C","title":["Tur\u00e1n number of generalized triangles"],"prefix":"10.1016","volume":"146","author":[{"given":"S.","family":"Norin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-7277-4273","authenticated-orcid":false,"given":"L.","family":"Yepremyan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcta.2016.09.003_br0010","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90133-2","article-title":"On the connection between chromatic number, maximal clique and minimal degree of a graph","volume":"8","author":"Andr\u00e1sfai","year":"1974","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.jcta.2016.09.003_br0020","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(74)90105-8","article-title":"Three-graphs without two triples whose symmetric difference is contained in a third","volume":"8","author":"Bollob\u00e1s","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcta.2016.09.003_br0030","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF02579292","article-title":"Supersaturated graphs and hypergraphs","volume":"3","author":"Erd\u0151s","year":"1983","journal-title":"Combinatorica"},{"issue":"3\u20134","key":"10.1016\/j.jcta.2016.09.003_br0040","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF02579190","article-title":"A new generalization of the Erdos\u2013Ko\u2013Rado theorem","volume":"3","author":"Frankl","year":"1983","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/j.jcta.2016.09.003_br0050","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0097-3165(89)90067-8","article-title":"Extremal problems whose solutions are the blow-ups of the small Witt-designs","volume":"52","author":"Frankl","year":"1989","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"10.1016\/j.jcta.2016.09.003_br0060","doi-asserted-by":"crossref","first-page":"897","DOI":"10.4007\/annals.2007.166.897","article-title":"Hypergraph regularity and the multidimensional Szemer\u00e9di theorem","volume":"166","author":"Gowers","year":"2007","journal-title":"Ann. of Math. (2)"},{"issue":"8","key":"10.1016\/j.jcta.2016.09.003_br0070","doi-asserted-by":"crossref","first-page":"2020","DOI":"10.1016\/j.jcta.2013.07.011","article-title":"A hypergraph Tur\u00e1n theorem via Lagrangians of intersecting families","volume":"120","author":"Hefetz","year":"2013","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.jcta.2016.09.003_br0080","series-title":"Combinatorics","first-page":"215","article-title":"Extremal problems for hypergraphs","volume":"vol. 16","author":"Katona","year":"1975"},{"key":"10.1016\/j.jcta.2016.09.003_br0090","first-page":"83","article-title":"Hypergraph Tur\u00e1n Problems, Surveys in Combinatorics 2011","volume":"vol. 392","author":"Keevash","year":"2011"},{"issue":"1","key":"10.1016\/j.jcta.2016.09.003_br0100","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.jctb.2004.05.003","article-title":"Stability theorems for cancellative hypergraphs","volume":"92","author":"Keevash","year":"2004","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.jcta.2016.09.003_br0110","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","article-title":"Maxima for graphs and a new proof of a theorem of Tur\u00e1n","volume":"17","author":"Motzkin","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.jcta.2016.09.003_br0120","author":"Norin"},{"issue":"28","key":"10.1016\/j.jcta.2016.09.003_br0130","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s00493-008-2187-2","article-title":"An exact Tur\u00e1n result for the generalized triangle","author":"Pikhurko","year":"2008","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/j.jcta.2016.09.003_br0140","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1002\/rsa.20108","article-title":"Applications of the regularity lemma for uniform hypergraphs","volume":"28","author":"R\u00f6dl","year":"2006","journal-title":"Random Structures Algorithms"},{"issue":"1","key":"10.1016\/j.jcta.2016.09.003_br0150","doi-asserted-by":"crossref","DOI":"10.37236\/1239","article-title":"A new construction for cancellative families of sets","volume":"3","author":"Shearer","year":"1996","journal-title":"Electron. J. Combin."},{"issue":"3","key":"10.1016\/j.jcta.2016.09.003_br0160","first-page":"247","article-title":"The maximal number of edges in a homogeneous hypergraph containing no prohibited subgraphs","volume":"41","author":"Sidorenko","year":"1987","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"10.1016\/j.jcta.2016.09.003_br0170","series-title":"Theory of Graphs, Proc. Colloq.","first-page":"279","article-title":"A method for solving extremal problems in graph theory, stability problems","author":"Simonovits","year":"1968"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S009731651630084X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S009731651630084X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T02:26:28Z","timestamp":1612146388000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S009731651630084X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":17,"alternative-id":["S009731651630084X"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jcta.2016.09.003","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2017,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tur\u00e1n number of generalized triangles","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series A","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jcta.2016.09.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}