{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T20:23:41Z","timestamp":1773087821196,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf02124681","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T12:19:53Z","timestamp":1126700393000},"page":"207-215","source":"Crossref","is-referenced-by-count":37,"title":["Asymptotic solution for a new class of forbiddenr-graphs"],"prefix":"10.1007","volume":"9","author":[{"given":"A. F.","family":"Sidorenko","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02124681_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(74)90105-8","volume":"8","author":"B. Bollob\u00e1s","year":"1974","unstructured":"B. Bollob\u00e1s, Tree-graphs without two triples whose symmetric difference is contained in a third,Discrete Math.,8 (1974), 21\u201324.","journal-title":"Discrete Math."},{"key":"BF02124681_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0012-365X(84)90178-X","volume":"48","author":"W. G. Brown","year":"1984","unstructured":"W. G. Brown andM. Simonovits, Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures,Discrete Math.,48 (1984), 147\u2013162.","journal-title":"Discrete Math."},{"key":"BF02124681_CR3","unstructured":"D.de Caen, On Turan's hypergraph problem,Ph. D. Thesis, Univ. Toronto, 1982."},{"key":"BF02124681_CR4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P. Erd\u0151s","year":"1959","unstructured":"P. Erd\u0151s andT. Gallai, On maximal paths and circuits of graphs,Acta Math. Hung.,10 (1959), 337\u2013356.","journal-title":"Acta Math. Hung."},{"key":"BF02124681_CR5","doi-asserted-by":"crossref","unstructured":"P.Erd\u0151s, Extremal problems in graph theory, In:Theory of graphs and its applications, Proc. Sympos. Smolenice, Prague, 1964, 29\u201336.","DOI":"10.4064\/cm-13-2-251-254"},{"key":"BF02124681_CR6","first-page":"51","volume":"1","author":"P. Erd\u0151s","year":"1966","unstructured":"P. Erd\u0151s andM. Simonovits, A limit theorem in graph theory,Studia Math. Hung.,1 (1966), 51\u201357.","journal-title":"Studia Math. Hung."},{"key":"BF02124681_CR7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF02579215","volume":"4","author":"P. Frankl","year":"1984","unstructured":"P. Frankl andV. R\u00f6dl, Hypergraphs do not jump,Combinatorica,4 (1984), 149\u2013159.","journal-title":"Combinatorica"},{"issue":"1\u20133","key":"BF02124681_CR8","first-page":"228","volume":"XV","author":"G. Katona","year":"1964","unstructured":"G. Katona, T. Nemetz andM. Simonovits, On a graph problem of Turan,Mat. Lapok,XV. 1\u20133 (1964), 228\u2013238, (in Hungarian).","journal-title":"Mat. Lapok"},{"key":"BF02124681_CR9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T. S. Motzkin","year":"1965","unstructured":"T. S. Motzkin andE. G. Strauss, Maxima of graphs and a new proof of a theorem of Turan,Canadian J. of Math.,17 (1965), 533\u2013540.","journal-title":"Canadian J. of Math."},{"key":"BF02124681_CR10","first-page":"3","volume":"37","author":"A. F. Sidorenko","year":"1982","unstructured":"A. F. Sidorenko, The method of quadratic forms and Tur\u00e1n's combinatorial problem,Moscow. Univ. Math. Bull.,37 (1982), 3\u20136.","journal-title":"Moscow. Univ. Math. Bull."},{"key":"BF02124681_CR11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01158259","volume":"41","author":"A. F. Sidorenko","year":"1987","unstructured":"A. F. Sidorenko, On the maximal number of edges in a uniform hypergraph without forbidden subgraphs,Math. Notes,41 (1987), 247\u2013259.","journal-title":"Math. Notes"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02124681.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02124681\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02124681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T21:31:09Z","timestamp":1557783069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02124681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF02124681"],"URL":"https:\/\/doi.org\/10.1007\/bf02124681","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}