{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:45:13Z","timestamp":1648964713879},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540427759","type":"print"},{"value":"9783540455066","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45506-x_8","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T14:36:53Z","timestamp":1188311813000},"page":"98-118","source":"Crossref","is-referenced-by-count":0,"title":["Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders"],"prefix":"10.1007","author":[{"given":"Hans J\u00fcrgen","family":"Pr\u00f6mel","sequence":"first","affiliation":[]},{"given":"Anusch","family":"Taraz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,23]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1002\/(SICI)1098-2418(1999010)14:1<63::AID-RSA3>3.0.CO;2-7","volume":"14","author":"D. Achlioptas","year":"1999","unstructured":"D. Achlioptas and E. Friedgut, A sharp threshold for k-colorability, Random Structures and Algorithms 14, 63\u201370, 1999.","journal-title":"Random Structures and Algorithms"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"D. Achlioptas and M. Molloy, The analysis of a list-coloring algorithm on a random graph, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 204\u2013212, 1997.","DOI":"10.1109\/SFCS.1997.646109"},{"key":"8_CR3","first-page":"1017","volume":"12","author":"E. Friedgut","year":"1999","unstructured":"E. Friedgut, Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem, Journal of the AMS 12, 1017\u20131054, 1999.","journal-title":"Journal of the AMS"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"M. Ajtai, J. Koml\u00f3s, and E. Szemer\u00e9di, Sorting in Clogn parallel steps, Combinatorica 3, 1\u201319, 1983.","journal-title":"Combinatorica"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF00341633","volume":"6","author":"M.H. Albert","year":"1989","unstructured":"M.H. Albert and A.M. Frieze, Random graph orders, Order 6, 19\u201330, 1989.","journal-title":"Order"},{"key":"8_CR6","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s, Random Graphs, Academic Press, London, 1985."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02122551","volume":"8","author":"B. Bollob\u00e1s","year":"1988","unstructured":"B. Bollob\u00e1s, The chromatic number of random graphs, Combinatorica 8, 49\u201355, 1988.","journal-title":"Combinatorica"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/BF02779671","volume":"59","author":"B. Bollob\u00e1s","year":"1987","unstructured":"B. Bollob\u00e1s and G. Brightwell, Graphs whose every transitive orientation contains almost every relation, Israel J. Math. 59, 112\u2013128, 1987.","journal-title":"Israel J. Math"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s and O.M. Riordan, Constrained graph processes, Electronic Journal of Combinatorics 7, R18, 2000.","DOI":"10.37236\/1496"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s and A. Thomason, Threshold functions, Combinatorica 7, 35\u201338.","DOI":"10.1007\/BF02579198"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"G. Brightwell, Models of random partial orders, in Surveys in Combinatorics (Walker, ed.), Cambridge University Press, 53\u201383, 1993.","DOI":"10.1017\/CBO9780511662089.004"},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0097-3165(96)80001-X","volume":"73","author":"G. Brightwell","year":"1996","unstructured":"G. Brightwell, H. J. Pr\u00f6mel, and A. Steger, The average number of linear extensions of a partial order, J. Combinat. Theory (A) 73, 193\u2013206, 1996.","journal-title":"J. Combinat. Theory (A)"},{"issue":"8","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1063\/1.523869","volume":"19","author":"D. Dhar","year":"1978","unstructured":"D. Dhar, Entropy and phase transitions in partially ordered sets, J. Math. Phys. 19(8), 1711\u20131713, 1978.","journal-title":"J. Math. Phys."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/rsa.3240020302","volume":"2","author":"P. Erd\u00f6s","year":"1991","unstructured":"P. Erd\u00f6s, H. Kierstead, and W.T. Trotter, The dimension of random ordered sets, Random Structures and Algorithms 2, 253\u2013275, 1991.","journal-title":"Random Structures and Algorithms"},{"key":"8_CR15","first-page":"19","volume":"17","author":"P. Erd\u00f6s","year":"1976","unstructured":"P. Erd\u00f6s, D. J. Kleitman, and B.L. Rothschild, Asymptotic enumeration of ingraphs, in International Colloquium on Combinatorial theory, Atti dei Convegni Lincei 17, Vol. 2, Rome, 19\u201327, 1976.","journal-title":"International Colloquium on Combinatorial theory, Atti dei Convegni Lincei"},{"key":"8_CR16","first-page":"290","volume":"6","author":"P. Erd\u00f6s","year":"1959","unstructured":"P. Erd\u00f6s and A. R\u00e9nyi, On random graphs I, Publ. Math. Debrecen 6, 290\u2013297, 1959.","journal-title":"Publ. Math. Debrecen"},{"key":"8_CR17","first-page":"17","volume":"5","author":"P. Erd\u00f6s","year":"1961","unstructured":"P. Erd\u00f6s and A. R\u00e9nyi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci. 5, 17\u201361, 1961.","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"issue":"4","key":"8_CR18","first-page":"343","volume":"38","author":"P. Erd\u00f6s","year":"1961","unstructured":"P. Erd\u00f6s and A. R\u00e9nyi, On the evolution of random graphs, Bull. Inst. Internat. Statist. 38(4), 343\u2013347, 1961.","journal-title":"Bull. Inst. Internat. Statist."},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02066689","volume":"12","author":"P. Erd\u00f6s","year":"1961","unstructured":"P. Erd\u00f6s and A. R\u00e9nyi, On the strength of connectedness of a random graph, Acad. Sci. Hungar. 12, 261\u2013267, 1961.","journal-title":"Acad. Sci. Hungar"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/rsa.3240060217","volume":"6","author":"P. Erd\u00f6s","year":"1995","unstructured":"P. Erd\u00f6s, S. Suen, and P. Winkler, On the size of a random maximal graph, Random Structures and Algorithms 6, 309\u2013318, 1995.","journal-title":"Random Structures and Algorithms"},{"key":"8_CR21","doi-asserted-by":"crossref","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"S. Janson, T. FLuczak, and A. Ruci\u0144ski, Random Graphs, Wiley-Interscience, New York, 2000.","DOI":"10.1002\/9781118032718"},{"key":"8_CR22","first-page":"351","volume-title":"Handbook of Combinatorics","author":"M. Karo\u0144ski","year":"1995","unstructured":"M. Karo\u0144ski: Random Graphs, in Handbook of Combinatorics, Volume 1, 351\u2013380. North-Holland, Amsterdam, 1995"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/rsa.3240070302","volume":"7","author":"J.H. Kim","year":"1995","unstructured":"J.H. Kim, The Ramsey number R(3,t) has order of magnitude t 2\/logt, Random Structures and Algorithms 7, 173\u2013207, 1995.","journal-title":"Random Structures and Algorithms"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"276","DOI":"10.2307\/2037205","volume":"25","author":"D.J. Kleitman","year":"1970","unstructured":"D.J. Kleitman and B.L. Rothschild, The number of finite topologies, Proc. Amer. Math. Soc. 25, 276\u2013282, 1970.","journal-title":"Proc. Amer. Math. Soc."},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"205","DOI":"10.2307\/1997200","volume":"205","author":"D.J. Kleitman","year":"1975","unstructured":"D.J. Kleitman and B.L. Rothschild, Asymptotic enumeration of partial orders on a finite set, Trans. Amer. Math. Soc. 205, 205\u2013220, 1975.","journal-title":"Trans. Amer. Math. Soc."},{"key":"8_CR26","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0378-4371(79)90212-7","volume":"96A","author":"D.J. Kleitman","year":"1979","unstructured":"D.J. Kleitman and B.L. Rothschild, A phase transition on partial orders, Physica 96A, 254\u2013259, 1979.","journal-title":"Physica"},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"637","DOI":"10.2307\/2000689","volume":"303","author":"Ph.G. Kolaitis","year":"1987","unstructured":"Ph.G. Kolaitis, H.J. Pr\u00f6mel, and B.L. Rothschild, K l+1-free graphs: asymptotic structure and a 0-1 law, Trans. Amer. Math. Soc. 303, 637\u2013671, 1987.","journal-title":"Trans. Amer. Math. Soc."},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"A.C. Kaporis, L.M. Kirousis, and Y.C. Stamatiou, A Note on the Non-Colorability Threshold of a Random Graph, Electronic Journal of Combinatorics 7, R29, 2000.","DOI":"10.37236\/1507"},{"key":"8_CR29","first-page":"547","volume-title":"Finite and Infinite Sets","author":"E. Lamken","year":"1984","unstructured":"E. Lamken and B.L. Rothschild, The number of odd-cycle-free graphs, in Finite and Infinite Sets (A. Hajnal, L. Lov\u00e1sz, and V.T. S\u00f3s, eds.), Colloq. Math. Soc. J\u00e1nos Bolyai 37, North-Holland, Amsterdam, 547\u2013553, 1984."},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01375472","volume":"11","author":"T. \u0141uczak","year":"1991","unstructured":"T. \u0141uczak, The chromatic number of sparse random graphs, Combinatorica 11, 45\u201354, 1991.","journal-title":"Combinatorica"},{"key":"8_CR31","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1002\/(SICI)1098-2418(200005)16:3<260::AID-RSA3>3.0.CO;2-Q","volume":"16","author":"T. \u0141uczak","year":"2000","unstructured":"T. \u0141uczak, On triangle-free random graphs, Random Structures and Algorithms 16, 260\u2013276, 2000.","journal-title":"Random Structures and Algorithms"},{"key":"8_CR32","unstructured":"D. Osthus, H.J. Pr\u00f6mel, and A. Taraz, On the evolution of triangle-free graphs, to appear in Combinatorica."},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/1098-2418(200101)18:1<61::AID-RSA5>3.0.CO;2-T","volume":"18","author":"D. Osthus","year":"2001","unstructured":"D. Osthus and A. Taraz, Random maximal H-free graphs, Random Structures and Algorithms 18, 61\u201382, 2001.","journal-title":"Random Structures and Algorithms"},{"key":"8_CR34","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jctb.1996.0036","volume":"67","author":"B. Pittel","year":"1996","unstructured":"B. Pittel and J. H. Spencer and N. C. Wormald, Sudden emergence of a giant k-core in a random graph, Journal of Comb. Theory Series B 67, 111\u2013151, 1996.","journal-title":"Journal of Comb. Theory Series B"},{"key":"8_CR35","unstructured":"H.J. Pr\u00f6mel, T. Schickinger, and A. Steger, A note on triangle-free and bipartite graphs, to appear in Discrete Mathematics."},{"key":"8_CR36","unstructured":"H.J. Pr\u00f6mel, T. Schickinger, and A. Steger, On the structure of clique-free graphs, to appear in Random Structures and Algorithms."},{"key":"8_CR37","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01305238","volume":"12","author":"H.J. Pr\u00f6mel","year":"1992","unstructured":"H.J. Pr\u00f6mel and A. Steger, The asymptotic number of graphs not containing a fixed color-critical subgraph, Combinatorica 12, 463\u2013473, 1992.","journal-title":"Combinatorica"},{"key":"8_CR38","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<137::AID-JGT3>3.0.CO;2-S","volume":"21","author":"H.J. Pr\u00f6mel","year":"1996","unstructured":"H.J. Pr\u00f6mel and A. Steger, On the asymptotic structure of sparse triangle-free graphs, Journal of Graph Theory 21, 137\u2013151, 1996.","journal-title":"Journal of Graph Theory"},{"key":"8_CR39","unstructured":"H.J. Pr\u00f6mel, A. Steger, and A. Taraz, Counting partial orders with a fixed number of comparable pairs, to appear in Combinatorics, Probability and Computing."},{"key":"8_CR40","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1006\/jcta.2000.3135","volume":"94","author":"H.J. Pr\u00f6mel","year":"2001","unstructured":"H.J. Pr\u00f6mel, A. Steger, and A. Taraz, Phase transitions in the evolution of partial orders, Journal of Combinatorial Theory, Series A 94, 230\u2013275, 2001.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"8_CR41","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1017\/S0963548300000183","volume":"1","author":"A. Ruci\u0144ski","year":"1992","unstructured":"A. Ruci\u0144ski and N. C. Wormald, Random graph processes with degree restrictions, Combinatorics, Probability and Computing 1, 169\u2013180, 1992.","journal-title":"Combinatorics, Probability and Computing"},{"key":"8_CR42","volume-title":"unpublished manuscript","author":"A. Steger","year":"1999","unstructured":"A. Steger, unpublished manuscript, Technische Universit\u00e4t M\u00fcnchen, 1999."},{"key":"8_CR43","doi-asserted-by":"crossref","unstructured":"W.T. Trotter, Applications of the probabilistic method to partially ordered sets, in The mathematics of Paul Erd\u00f6s II (R.L. Graham and J. Ne\u0161et\u0159il, eds.), Algorithms and Combinatorics, Vol. 14, Springer-Verlag, 214\u2013228, 1997.","DOI":"10.1007\/978-3-642-60406-5_18"},{"key":"8_CR44","series-title":"NATO ASI Series","volume-title":"Finite and Infinite Combinatorics of Sets and Logic","author":"P. Winkler","year":"1991","unstructured":"P. Winkler, Random structures and 0-1 laws, in Finite and Infinite Combinatorics of Sets and Logic (N.W. Sauer, R.E. Woodrow, and B. Sands, eds.) NATO ASI Series, Kluwer Academic publishers, Dordrecht, 1991."}],"container-title":["Computational Discrete Mathematics","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45506-X_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T05:13:01Z","timestamp":1587877981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45506-X_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427759","9783540455066"],"references-count":44,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45506-x_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2001]]}}}