{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:50Z","timestamp":1761611150316},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":[[1997,12]]},"DOI":"10.1007\/bf01195005","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T11:14:18Z","timestamp":1108725258000},"page":"577-596","source":"Crossref","is-referenced-by-count":31,"title":["Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs"],"prefix":"10.1007","volume":"17","author":[{"given":"Mikl\ufffds","family":"Simonovits","sequence":"first","affiliation":[]},{"given":"Vera T.","family":"S\ufffds","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"B. Bollob\ufffds:Random Graphs, Academic Press, 1985."},{"issue":"4","key":"CR2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02125347","volume":"9","author":"F. R. K. Chung","year":"1989","unstructured":"F. R. K. Chung, R. L. Graham andR. M. Wilson: Quasi-random graphs,Combinatorica,9 (4), (1989), 345?362.","journal-title":"Combinatorica"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/rsa.3240010108","volume":"1","author":"F. R. K. Chung","year":"1990","unstructured":"F. R. K. Chung, R. Graham andR. L. Graham: Quasi-random hypergraphs,Random Structures and Algorithms,1 (1990), 105?124.","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"CR4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/rsa.3240020208","volume":"2","author":"F. R. K. Chung","year":"1991","unstructured":"F. R. K. Chung: Regularity lemmas for hypergraphs and quasi-randomness,Random Structures and Algorithms, Vol.2 (2) (1991), 241?252.","journal-title":"Random Structures and Algorithms"},{"issue":"1","key":"CR5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1090\/S0894-0347-1991-1077279-1","volume":"4","author":"F. R. K. Chung","year":"1991","unstructured":"F. R. K. Chung andR. L. Graham: Quasi-random set systems,Journal of the American Math. Society,4 (1) January, (1991), 151?196.","journal-title":"Journal of the American Math. Society"},{"key":"CR6","unstructured":"F. R. K. Chung andR. L. Graham: Maximum cuts and quasi-random graphs,in Random Graphs, (Poznan Conf, 1989) Wiley-Intersci, Publ. vol 2, 23?33."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"F. R. K. Chung andR. L. Graham: On hypergraphs having evenly distributed subhypergraphs, (in the Proc. Conf. Marseille-Luminy, 1990) Discrete Mathematics,111 (1?3) (1993), 125?129.","DOI":"10.1016\/0012-365X(93)90148-M"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"M. Dyer andA. Frieze: Computing the volume of convex bodies: a case where randomness provably helps, inProbabilistic Combinatorics and Its Applications (ed. B\ufffdla Bollob\ufffds), Proceedings of Symposia in Applied Mathematics, Vol. 44 (1992), 123?170.","DOI":"10.1090\/psapm\/044\/1141926"},{"issue":"3","key":"CR9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0095-8956(88)90040-8","volume":"44","author":"P. Frankl","year":"1988","unstructured":"P. Frankl, V. R\ufffddl andR. M. Wilson: The number of submatrices of given type in an Hadamard matrix and related results,Journal of Combinatorial Theory, (B) 44 (3) (1988), 317?328.","journal-title":"Journal of Combinatorial Theory, (B)"},{"key":"CR10","first-page":"1","volume":"1","author":"A. N. Kolmogorov","year":"1965","unstructured":"A. N. Kolmogorov: Three approaches to the quantitative definition of information,Problems Inform. Transmition,1 (1965), 1?7.","journal-title":"Problems Inform. Transmition"},{"issue":"1","key":"CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01196135","volume":"17","author":"J. Koml\ufffds","year":"1997","unstructured":"J. Koml\ufffds, G. N. S\ufffdrk\ufffdzy andE. Szemer\ufffddi: Blow-up Lemma,Combinatorica,17 (1) (1997), 109?123.","journal-title":"Combinatorica"},{"key":"CR12","unstructured":"J. Koml\ufffds andM. Simonovits: Szemer\ufffddi Regularity lemma and its applications in Extremal Graph Theory, in:Paul Erd?s is 80, II. Bolyai J. Math. Soc. 2, (1996), 295?352."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.3240020102","volume":"2","author":"M. Simonovits","year":"1991","unstructured":"M. Simonovits andV. T. S\ufffds: Szemer\ufffddi's Partition and quasi-randomness,Random Structures and Algorithms,2 (1991), 1?10.","journal-title":"Random Structures and Algorithms"},{"key":"CR14","unstructured":"M. Simonovits andV. T. S\ufffds: Hereditarily extended properties, quasi-random graphs and induced subgraphs, manuscript."},{"key":"CR15","unstructured":"E. Szemer\ufffddi: On regular partitions of graphs,Problemes Combinatoires et Th\ufffdorie des Graphes (ed. J. Bermond et al.), CNRS Paris, 1978, 399?401."},{"key":"CR16","first-page":"111","volume":"23","author":"E. Szemer\ufffddi","year":"1972","unstructured":"E. Szemer\ufffddi: On graphs containing no complete subgraphs with 4 vertices (in Hungarian)Mat. Lapok 23 (1972), 111?116.","journal-title":"Mat. Lapok"},{"key":"CR17","series-title":"LMS Lecture Notes Series","first-page":"173","volume-title":"Surveys in Combinatorics","author":"A. Thomason","year":"1987","unstructured":"A. Thomason: Random graphs, strongly regular graphs and pseudo-random graphs, in:Surveys in Combinatorics, 1987 (Whitehead, ed.) LMS Lecture Notes Series 123, Cambridge Univ. Press, Cambridge, 1987, 173?196."},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"A. Thomason: Pseudo-random graphs, in:Proceedings of Random graphs, Poznan, 1985, (M. Karonski, ed.);Annals of Discrete Math.,33 (1987), 307?331.","DOI":"10.1016\/S0304-0208(08)73063-9"},{"issue":"2","key":"CR19","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1112\/jlms\/s2-39.2.246","volume":"39","author":"A. Thomason","year":"1989","unstructured":"A. Thomason: A disproof of a theorem of Erd?s in Ramsey theory,J. London Math. Soc,39 (2) (1989), 246?255.","journal-title":"J. London Math. Soc"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01195005.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01195005\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01195005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:52:31Z","timestamp":1586119951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01195005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["BF01195005"],"URL":"https:\/\/doi.org\/10.1007\/bf01195005","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}