{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:43:00Z","timestamp":1725482580174},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673064"},{"type":"electronic","value":"9783540464150"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10719839_5","type":"book-chapter","created":{"date-parts":[[2007,4,11]],"date-time":"2007-04-11T08:13:55Z","timestamp":1176279235000},"page":"48-57","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Equivalent Conditions for Regularity \u00a0(Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Y.","family":"Kohayakawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"R\u00f6dl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Skokan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,12]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0022-0000(92)90047-M","volume":"45","author":"L. Babai","year":"1992","unstructured":"Babai, L., Nisan, N., Szegedy, M.: Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. J. Comput. System Sci.\u00a045(2), 204\u2013232 (1992); Twenty-first Symposium on the Theory of Computing, Seattle,WA (1989)","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1002\/rsa.3240010401","volume":"1","author":"F.R.K. Chung","year":"1990","unstructured":"Chung, F.R.K.: Quasi-random classes of hypergraphs. Random Structures and Algorithms\u00a01(4), 363\u2013382 (1990)","journal-title":"Random Structures and Algorithms"},{"issue":"1","key":"5_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(1), 105\u2013124 (1990)","journal-title":"Random Structures and Algorithms"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1090\/S0894-0347-1991-1077279-1","volume":"4","author":"F.R.K. Chung","year":"1991","unstructured":"Chung, F.R.K., Graham, R.L.: Quasi-random set systems. Journal of the American Mathematical Society\u00a04(1), 151\u2013196 (1991)","journal-title":"Journal of the American Mathematical Society"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/0406009","volume":"6","author":"F.R.K. Chung","year":"1993","unstructured":"Chung, F.R.K., Tetali, P.: Communication complexity and quasi randomness. SIAM J. Discrete Math.\u00a06(1), 110\u2013123 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF02351586","volume":"8","author":"P. Frankl","year":"1992","unstructured":"Frankl, P., R\u00f6dl, V.: The uniformity lemma for hypergraphs. Graphs and Combinatorics\u00a08(4), 309\u2013312 (1992)","journal-title":"Graphs and Combinatorics"},{"issue":"1-3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(89)90093-9","volume":"75","author":"J. Haviland","year":"1989","unstructured":"Haviland, J., Thomason, A.G.: Pseudo-random hypergraphs. Discrete Math.\u00a075(1-3), 255\u2013278 (1989); Graph theory and combinatorics, Cambridge (1988)","journal-title":"Discrete Math."},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0012-365X(92)90324-9","volume":"103","author":"J. Haviland","year":"1992","unstructured":"Haviland, J., Thomason, A.G.: On testing the \u201cpseudo-randomness\u201d of a hypergraph. Discrete Math.\u00a0103(3), 321\u2013327 (1992)","journal-title":"Discrete Math."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Kohayakawa, Y., R\u00f6dl, V., Skokan, J.: Equivalent conditions for regularity (1999) (in preparation)","DOI":"10.1007\/10719839_5"},{"key":"5_CR10","unstructured":"Kohayakawa, Y., R\u00f6dl, V., Szemer\u00e9di, E.: The size-Ramsey number of graphs of bounded degree (1999) (in preparation)"},{"key":"5_CR11","unstructured":"R\u00f6dl, V., Skokan, J.: Uniformity of set systems (1999) (in preparation)"},{"key":"#cr-split#-5_CR12.1","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs, Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes. (Colloq. Internat. CNRS, Univ. Orsay, Orsay) (1976)"},{"key":"#cr-split#-5_CR12.2","unstructured":"Colloques Internationaux CNRS 260, pp. 399-401 (1978)"},{"key":"5_CR13","first-page":"307","volume-title":"Random graphs 1985","author":"A.G. Thomason","year":"1985","unstructured":"Thomason, A.G.: Pseudorandom graphs. In: Random graphs 1985, Pozna\u0144. North-Holland, Amsterdam (1985); Math. Stud., vol. 144, pp. 307\u2013331. North-Holland, Amsterdam-NewYork (1987)"},{"key":"5_CR14","series-title":"London Mathematical Society Lecture Note Series","first-page":"173","volume-title":"Surveys in Combinatorics","author":"A.G. Thomason","year":"1987","unstructured":"Thomason, A.G.: Random graphs, strongly regular graphs and pseudorandom graphs. In: Whitehead, C. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol.\u00a0123, pp. 173\u2013195. Cambridge University Press, Cambridge (1987)"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0022-314X(72)90009-1","volume":"4","author":"R.M. Wilson","year":"1972","unstructured":"Wilson, R.M.: Cyclotomy and difference families in elementary abelian groups. J. Number Theory\u00a04, 17\u201347 (1972)","journal-title":"J. Number Theory"}],"container-title":["Lecture Notes in Computer Science","LATIN 2000: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10719839_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T07:39:55Z","timestamp":1567237195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719839_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673064","9783540464150"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/10719839_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"12 April 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}