{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:34Z","timestamp":1725489154918},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_42","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T09:44:11Z","timestamp":1187343851000},"page":"428-438","source":"Crossref","is-referenced-by-count":0,"title":["Can a Graph Have Distinct Regular Partitions?"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Asaf","family":"Shapira","sequence":"additional","affiliation":[]},{"given":"Uri","family":"Stav","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","first-page":"473","volume-title":"Proc. of 33 rd IEEE FOCS","author":"N. Alon","year":"1992","unstructured":"Alon, N., Duke, R.A., Lefmann, H., R\u00f6dl, V., Yuster, R.: The algorithmic aspects of the Regularity Lemma. In: Proc. of 33\n                  rd\n                 IEEE FOCS, Pittsburgh, pp. 473\u2013481. IEEE, Los Alamitos (1992) (Also: J. of Algorithms 16, 80\u2013109 (1994))"},{"key":"42_CR2","first-page":"656","volume-title":"Proc. of the 40 IEEE FOCS","author":"N. Alon","year":"1999","unstructured":"Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. In: Proc. of the 40 IEEE FOCS, pp. 656\u2013666. IEEE, Los Alamitos (1999) Also: Combinatorica 20, 451\u2013476 (2000)"},{"key":"42_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)","edition":"2"},{"key":"42_CR4","first-page":"147","volume":"5","author":"G. Birkhoff","year":"1946","unstructured":"Birkhoff, G.: Three observations on linear algebra. Univ. Nac. Tucum\u00e1n. Rev. Ser. A\u00a05, 147\u2013151 (1946)","journal-title":"Univ. Nac. Tucum\u00e1n. Rev. Ser. A"},{"key":"42_CR5","unstructured":"Fischer, E., Matsliach, A., Shapira, A.: A hypergraph approach for finding small regular partitions (preprint, 2007)"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/PL00001621","volume":"7","author":"T. Gowers","year":"1997","unstructured":"Gowers, T.: Lower bounds of tower type for Szemer\u00e9di\u2019s uniformity lemma. GAFA\u00a07, 322\u2013337 (1997)","journal-title":"GAFA"},{"key":"42_CR7","unstructured":"Koml\u00f3s, J., Simonovits, M.: Szemer\u00e9di\u2019s Regularity Lemma and its applications in graph theory. In: Mikl\u00f3s, D., S\u00f3s, V.T., Sz\u00f6nyi, T. (eds.) Combinatorics, Paul Erd\u00f6s is Eighty, Budapest. J\u00e1nos Bolyai Math.\u00a0Soc., vol.\u00a0II, pp. 295\u2013352 (1996)"},{"key":"42_CR8","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":"42_CR9","unstructured":"Lov\u00e1sz, L.: Private communication (2006)"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Szegedy, B.: Szemer\u00e9di\u2019s lemma for the analyst, GAFA (to appear)","DOI":"10.1007\/s00039-007-0599-6"},{"key":"42_CR11","unstructured":"R\u00f6dl, V., Schacht, M.: Regular partitions of hypergraphs, Combinatorics, Probability and Computing (to appear)"},{"key":"42_CR12","unstructured":"Sudan, M.: Private communication (2005)"},{"key":"42_CR13","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs. In: Bermond, J.C., Fournier, J.C., Las Vergnas, M., Sotteau, D. (eds.) Proc. Colloque Inter. CNRS, pp. 399\u2013401 (1978)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:17:58Z","timestamp":1619504278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}