{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T12:35:26Z","timestamp":1774528526951,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":[[1991,3]]},"DOI":"10.1007\/bf01375476","type":"journal-article","created":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T15:19:45Z","timestamp":1112368785000},"page":"75-79","source":"Crossref","is-referenced-by-count":38,"title":["On a Tur\ufffdn type problem of Erd\ufffds"],"prefix":"10.1007","volume":"11","author":[{"given":"Zolt\ufffdn","family":"F\ufffdredi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Extremal Graph Theory","author":"B. Bollob\ufffds","year":"1978","unstructured":"B. Bollob\ufffds,Extremal Graph Theory, Academic Press, London-New York, 1978."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.4153\/CMB-1966-036-2","volume":"9","author":"W. G. Brown","year":"1966","unstructured":"W. G. Brown, On graphs that do not contain a Thomsen graph,Canad. Math. Bull. 9 (1966), 281?289.","journal-title":"Canad. Math. Bull."},{"key":"CR3","first-page":"5","volume":"16","author":"D. Caen de","year":"1983","unstructured":"D. de Caen, Extension of a theorem of Moon and Moser on complete hypergraphs,Ars Combinatoria,16 (1983), 5?10.","journal-title":"Ars Combinatoria"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02760037","volume":"3","author":"P. Erd?s","year":"1965","unstructured":"P. Erd?s, On some extremal problems in graph theory,Israel J. Math. 3 (1965), 113?116.","journal-title":"Israel J. Math."},{"key":"CR5","first-page":"117","volume-title":"Theory of Graphs","author":"P. Erd?s","year":"1967","unstructured":"P. Erd?s, Some recent results on extremal problems in graph theory,Theory of Graphs (Internat. Sympos, Rome, 1966), Gordon and Breach, New York, 1967, 117?130."},{"key":"CR6","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0066181","volume-title":"Hypergraph Seminar","author":"P. Erd?s","year":"1974","unstructured":"P. Erd?s, Extremal problems on graphs and hypergraphs,in Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Colubmus, Ohio, 1972)Lecture Notes in Math. 411, Springer, Berlin, 1974. pp. 75?84."},{"key":"CR7","unstructured":"P. Erd?s, Problems and results on finite and infinite combinatorial analysis,in Infinite and Finite Sets (Proc. Conf. Keszthely, Hungary, 1973.)Proc. Colloq. Math. Soc. J. Bolyai 10 Bolyai-North-Holland, 1975. pp. 403?424."},{"key":"CR8","first-page":"215","volume":"1","author":"P. Erd?s","year":"1966","unstructured":"P. Erd?s, A. R\ufffdnyi andV. T. S\ufffds, On a problem of graph theory,Studia Sci. Math. Hungar. 1 (1966), 215?235.","journal-title":"Studia Sci. Math. Hungar."},{"key":"CR9","first-page":"51","volume":"1","author":"P. Erd?s","year":"1966","unstructured":"P. Erd?s andM. Simonovits, A limit theorem in graph theory,Studia Sci. Math. Hungar. 1 (1966), 51?57.","journal-title":"Studia Sci. Math. Hungar."},{"key":"CR10","first-page":"203","volume-title":"Progress in graph Theory (Waterloo, Ont. 1982)","author":"P. Erd?s","year":"1984","unstructured":"P. Erd?s andM. Simonovits, Cube-supersaturated graphs and related problems,Progress in graph Theory (Waterloo, Ont. 1982), 203?218. Academic Press, Toronto, Ont., 1984."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","volume":"52","author":"P. Erd?s","year":"1946","unstructured":"P. Erd?s andA. H. Stone, On the structure of linear graphs,Bull. Amer. Math. Soc. 52 (1946), 1087?1091.","journal-title":"Bull. Amer. Math. Soc."},{"key":"CR12","unstructured":"Z. F\ufffdredi, Quadrilateral-free graphs with maximum number of edges,to appear"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K?v\ufffdri","year":"1954","unstructured":"T. K?v\ufffdri, V. T. S\ufffds, andP. Tur\ufffdn, On a problem of K. Zarankiewicz,Colloquium Math. 3 (1954), 50?57.","journal-title":"Colloquium Math."},{"key":"CR14","first-page":"419","volume-title":"Progress in graph Theory (Waterloo, Ont. 1982)","author":"M. Simonovits","year":"1984","unstructured":"M. Simonovits, Extremal graph problems, degenerate extremal problems, and supersaturated graphs,Progress in graph Theory (Waterloo, Ont. 1982), 419?437. Academic Press, Toronto, Ont., 1984."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01375476.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01375476\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01375476","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T11:21:53Z","timestamp":1556796113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01375476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["BF01375476"],"URL":"https:\/\/doi.org\/10.1007\/bf01375476","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}