{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:36:50Z","timestamp":1775054210624,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441472","type":"print"},{"value":"9783540457268","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45726-7_7","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T05:55:49Z","timestamp":1186811749000},"page":"78-90","source":"Crossref","is-referenced-by-count":11,"title":["On the 2-Colorability of Random Hypergraphs"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Achlioptas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristopher","family":"Moore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,23]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1002\/rsa.997","volume":"20","author":"D. Achlioptas","year":"2002","unstructured":"Achlioptas, D., Kim, J.H., Krivelevich, M. AND Tetali, P. Two-coloring random hypergraphs. Random Structures Algorithms, 20(2):249\u2013259, 2002.","journal-title":"Random Structures Algorithms"},{"key":"7_CR2","unstructured":"Achlioptas, D., AND Moore, C. The asymptotic order of the random k-SAT threshold. To appear in 43rd Annual Symposium on Foundations of Computer Science (Vancouver, BC, 2002)."},{"key":"7_CR3","unstructured":"Alon, N., AND Spencer, J. A note on coloring random k-sets. Unpublished manuscript."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0012-365X(78)90191-7","volume":"2","author":"J. Beck","year":"1978","unstructured":"Beck, J. On 3-chromatic hypergraphs. Discrete Math. 24, 2 (1978), 127\u2013137.","journal-title":"Discrete Math. 24"},{"key":"7_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/S0924-6509(08)70096-5","volume-title":"Hypergraphs","author":"C. Berge","year":"1989","unstructured":"Berge, C.Hypergraphs. North-Holland Publishing Co., Amsterdam, 1989. Combinatorics of finite sets, Translated from the French."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bernstein, F. Zur theorie der trigonometrische reihen. Leipz. Ber. 60, (1908), 325\u2013328.","DOI":"10.1515\/crll.1908.134.95"},{"key":"7_CR7","first-page":"289","volume":"3","author":"M.-T. Chao","year":"1990","unstructured":"Chao, M.-T., AND Franco, J. Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem. Inform. Sci. 51, 3 (1990), 289\u2013314.","journal-title":"Inform. Sci. 51"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1109\/SFCS.1992.267789","volume-title":"33rd Annual Symposium on Foundations of Computer Science (Pittsburgh, PA, 1992)","author":"V. Chvatal","year":"1992","unstructured":"Chvatal, V., AND Reed, B. Mick gets some (the odds are on his side). In 33rd Annual Symposium on Foundations of Computer Science (Pittsburgh, PA, 1992). IEEE Comput. Soc. Press, Los Alamitos, CA, 1992, pp. 620\u2013627."},{"key":"7_CR9","unstructured":"De Bruijn, N.G. Asymptotic Methods in Analysis. North-Holland, 1958."},{"key":"7_CR10","unstructured":"Erd\u0151s, P. On a combinatorial problem. Nordisk Mat. Tidskr. 11 (1963), 5\u201310, 40."},{"key":"7_CR11","unstructured":"Erd\u0151s, P., AND Lov\u00e1sz, L. Problems and results on 3-chromatic hypergraphs and some related questions. 609\u2013627. Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 10."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Knuth, D. E., AND Pittel, B. The first cycles in an evolving graph. Discrete Math. 75, 1\u20133 (1989), 167-215. Graph theory and combinatorics (Cambridge, 1988).","DOI":"10.1016\/0012-365X(89)90087-3"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"E Friedgut","year":"1999","unstructured":"Friedgut, E. Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem. J. Amer. Math. Soc. 12 (1999), 1017\u20131054.","journal-title":"J. Amer. Math. Soc."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Frieze, A. AND McDiarmid, C. Algorithmic theory of random graphs. Random Struct. Alg. 10, (1997), 5\u201342.","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<5::AID-RSA2>3.3.CO;2-6"},{"key":"7_CR15","series-title":"Bolyai Soc. Math. Stud.","first-page":"283","volume-title":"Combinatorics","author":"M. Karo\u0144ski","year":"1993","unstructured":"Karo\u0144ski, M. AND, Lklupuczak, T. Random hypergraphs. Combinatorics, Paul Erd\u0151s is eighty, Vol. 2 (Kesztheley, 1993), 283\u2013293, Bolyai Soc. Math. Stud., 2, Janos Bolyai Math. Soc., Budapest, 1996."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Krivelevich, M. AND Sudakov, B. The chromatic numbers of random hypergraphs. Random Struct. Alg. 12, (1998), 381\u2013403.","DOI":"10.1002\/(SICI)1098-2418(199807)12:4<381::AID-RSA5>3.0.CO;2-P"},{"key":"7_CR17","unstructured":"Lov\u00e1sz, L. Coverings and coloring of hypergraphs. Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, Florida, 1973), 3\u201312."},{"key":"7_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R. AND Raghavan, P.Randomized Algorithms. Cambridge University Press, Cambridge, 1995."},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1002\/(SICI)1098-2418(200001)16:1<4::AID-RSA2>3.0.CO;2-2","volume":"1","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., AND Srinivasan, A. Improved bounds and algorithms for hypergraph 2-coloring. Random Structures Algorithms 16, 1 (2000), 4\u201332.","journal-title":"Random Structures Algorithms 16"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Schmidt-Pruzan, J., AND Shamir, E., AND Upfal, E. Random hypergraph coloring algorithms and the weak chromatic number. Journal of Graph Theory 8, (1985), 347\u2013362.","DOI":"10.1002\/jgt.3190090307"}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45726-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:04:44Z","timestamp":1556737484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45726-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441472","9783540457268"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45726-7_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}