{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:31:58Z","timestamp":1725517918292},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853626"},{"type":"electronic","value":"9783540853633"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85363-3_47","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T15:29:28Z","timestamp":1219850968000},"page":"596-601","source":"Crossref","is-referenced-by-count":1,"title":["Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets"],"prefix":"10.1007","author":[{"given":"Raphael","family":"Yuster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","first-page":"151","volume":"4","author":"F.R.K. Chung","year":"1991","unstructured":"Chung, F.R.K., Graham, R.L.: Quasi-random set systems. Journal of the AMS\u00a04, 151\u2013196 (1991)","journal-title":"Journal of the AMS"},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/jgt.3190150206","volume":"15","author":"F.R.K. Chung","year":"1991","unstructured":"Chung, F.R.K., Graham, R.L.: Quasi-random tournaments. Journal of Graph Theory\u00a015, 173\u2013198 (1991)","journal-title":"Journal of Graph Theory"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/rsa.3240010108","volume":"1","author":"F.R.K. Chung","year":"1990","unstructured":"Chung, F.R.K., Graham, R.L.: Quasi-random hypergraphs. Random Structures and Algorithms\u00a01, 105\u2013124 (1990)","journal-title":"Random Structures and Algorithms"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02125347","volume":"9","author":"F.R.K. Chung","year":"1989","unstructured":"Chung, F.R.K., Graham, R.L., Wilson, R.M.: Quasi-random graphs. Combinatorica\u00a09, 345\u2013362 (1989)","journal-title":"Combinatorica"},{"key":"47_CR5","unstructured":"Gowers, T.: Quasirandom groups (manuscript, 2006)"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Krivelevich, M., Sudakov, B.: Pseudo-random graphs. In: Gy\u00f6ri, E., Katona, G.O.H., Lov\u00e1sz, L. (eds.) More sets, graphs and numbers. Bolyai Society Mathematical Studies, vol.\u00a015, pp. 199\u2013262.","DOI":"10.1007\/978-3-540-32439-3_10"},{"key":"47_CR7","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jctb.2007.06.005","volume":"98","author":"L. Lov\u00e1sz","year":"2008","unstructured":"Lov\u00e1sz, L., S\u00f3s, V.T.: Generalized quasirandom graphs. Journal of Combinatorial Theory Series B\u00a098, 146\u2013163 (2008)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Shapira, A.: Quasi-randomness and the distribution of copies of a fixed graph. Combinatorica (to appear)","DOI":"10.1007\/s00493-008-2375-0"},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/BF01195005","volume":"17","author":"M. Simonovits","year":"1997","unstructured":"Simonovits, M., S\u00f3s, V.T.: Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs. Combinatorica\u00a017, 577\u2013596 (1997)","journal-title":"Combinatorica"},{"key":"47_CR10","first-page":"307","volume-title":"Annals of Discrete Math.","year":"1987","unstructured":"Thomason, A.: Pseudo-random graphs. In: Proc. of Random Graphs, Pozna\u0144 (1985); Karo\u0144ski, M. (ed.): Annals of Discrete Math.,\u00a033, 307\u2013331 (1987)"},{"key":"47_CR11","unstructured":"Thomason, A.: Random graphs, strongly regular graphs and pseudo-random graphs. In: Whitehead, C. (ed.) Surveys in Combinatorics. LMS Lecture Note Series, vol.\u00a0123, pp. 173\u2013195 (1987)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85363-3_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:35:12Z","timestamp":1619508912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85363-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540853626","9783540853633"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85363-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}