Skip to main content
SpringerLink
Log in

Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders

  • Chapter
  • First Online:
Computational Discrete Mathematics

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2122))

  • 1177 Accesses

Abstract

While everybody seems to immediately understand and accept the commonly used model of a random graph - simply toss a coin for every edge to decide whether it is there - the situation gets harder when we require that the random graph must satisfy some additional constraints such as having no triangles or being transitive.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Achlioptas and E. Friedgut, A sharp threshold for k-colorability, Random Structures and Algorithms 14, 63–70, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  2. 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–212, 1997.

    Google Scholar 

  3. E. Friedgut, Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem, Journal of the AMS 12, 1017–1054, 1999.

    MATH  MathSciNet  Google Scholar 

  4. M. Ajtai, J. Komlós, and E. Szemerédi, Sorting in Clogn parallel steps, Combinatorica 3, 1–19, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  5. M.H. Albert and A.M. Frieze, Random graph orders, Order 6, 19–30, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  6. B. Bollobás, Random Graphs, Academic Press, London, 1985.

    MATH  Google Scholar 

  7. B. Bollobás, The chromatic number of random graphs, Combinatorica 8, 49–55, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  8. B. Bollobás and G. Brightwell, Graphs whose every transitive orientation contains almost every relation, Israel J. Math. 59, 112–128, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  9. B. Bollobás and O.M. Riordan, Constrained graph processes, Electronic Journal of Combinatorics 7, R18, 2000.

    Google Scholar 

  10. B. Bollobás and A. Thomason, Threshold functions, Combinatorica 7, 35–38.

    Google Scholar 

  11. G. Brightwell, Models of random partial orders, in Surveys in Combinatorics (Walker, ed.), Cambridge University Press, 53–83, 1993.

    Google Scholar 

  12. G. Brightwell, H. J. Prömel, and A. Steger, The average number of linear extensions of a partial order, J. Combinat. Theory (A) 73, 193–206, 1996.

    MATH  Google Scholar 

  13. D. Dhar, Entropy and phase transitions in partially ordered sets, J. Math. Phys. 19(8), 1711–1713, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  14. P. Erdös, H. Kierstead, and W.T. Trotter, The dimension of random ordered sets, Random Structures and Algorithms 2, 253–275, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  15. P. Erdös, 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–27, 1976.

    Google Scholar 

  16. P. Erdös and A. Rényi, On random graphs I, Publ. Math. Debrecen 6, 290–297, 1959.

    MATH  MathSciNet  Google Scholar 

  17. P. Erdös and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci. 5, 17–61, 1961.

    Google Scholar 

  18. P. Erdös and A. Rényi, On the evolution of random graphs, Bull. Inst. Internat. Statist. 38(4), 343–347, 1961.

    MATH  MathSciNet  Google Scholar 

  19. P. Erdös and A. Rényi, On the strength of connectedness of a random graph, Acad. Sci. Hungar. 12, 261–267, 1961.

    Article  MATH  Google Scholar 

  20. P. Erdös, S. Suen, and P. Winkler, On the size of a random maximal graph, Random Structures and Algorithms 6, 309–318, 1995.

    MATH  MathSciNet  Google Scholar 

  21. S. Janson, T. FLuczak, and A. Ruciński, Random Graphs, Wiley-Interscience, New York, 2000.

    MATH  Google Scholar 

  22. M. Karoński: Random Graphs, in Handbook of Combinatorics, Volume 1, 351–380. North-Holland, Amsterdam, 1995

    Google Scholar 

  23. J.H. Kim, The Ramsey number R(3,t) has order of magnitude t 2/logt, Random Structures and Algorithms 7, 173–207, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  24. D.J. Kleitman and B.L. Rothschild, The number of finite topologies, Proc. Amer. Math. Soc. 25, 276–282, 1970.

    Article  MATH  MathSciNet  Google Scholar 

  25. D.J. Kleitman and B.L. Rothschild, Asymptotic enumeration of partial orders on a finite set, Trans. Amer. Math. Soc. 205, 205–220, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  26. D.J. Kleitman and B.L. Rothschild, A phase transition on partial orders, Physica 96A, 254–259, 1979.

    Google Scholar 

  27. Ph.G. Kolaitis, H.J. Prömel, and B.L. Rothschild, K l+1-free graphs: asymptotic structure and a 0-1 law, Trans. Amer. Math. Soc. 303, 637–671, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  28. 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.

    Google Scholar 

  29. E. Lamken and B.L. Rothschild, The number of odd-cycle-free graphs, in Finite and Infinite Sets (A. Hajnal, L. Lovász, and V.T. Sós, eds.), Colloq. Math. Soc. János Bolyai 37, North-Holland, Amsterdam, 547–553, 1984.

    Google Scholar 

  30. T. Łuczak, The chromatic number of sparse random graphs, Combinatorica 11, 45–54, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  31. T. Łuczak, On triangle-free random graphs, Random Structures and Algorithms 16, 260–276, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  32. D. Osthus, H.J. Prömel, and A. Taraz, On the evolution of triangle-free graphs, to appear in Combinatorica.

    Google Scholar 

  33. D. Osthus and A. Taraz, Random maximal H-free graphs, Random Structures and Algorithms 18, 61–82, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  34. 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–151, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  35. H.J. Prömel, T. Schickinger, and A. Steger, A note on triangle-free and bipartite graphs, to appear in Discrete Mathematics.

    Google Scholar 

  36. H.J. Prömel, T. Schickinger, and A. Steger, On the structure of clique-free graphs, to appear in Random Structures and Algorithms.

    Google Scholar 

  37. H.J. Prömel and A. Steger, The asymptotic number of graphs not containing a fixed color-critical subgraph, Combinatorica 12, 463–473, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  38. H.J. Prömel and A. Steger, On the asymptotic structure of sparse triangle-free graphs, Journal of Graph Theory 21, 137–151, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  39. H.J. Prömel, A. Steger, and A. Taraz, Counting partial orders with a fixed number of comparable pairs, to appear in Combinatorics, Probability and Computing.

    Google Scholar 

  40. H.J. Prömel, A. Steger, and A. Taraz, Phase transitions in the evolution of partial orders, Journal of Combinatorial Theory, Series A 94, 230–275, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  41. A. Ruciński and N. C. Wormald, Random graph processes with degree restrictions, Combinatorics, Probability and Computing 1, 169–180, 1992.

    MATH  MathSciNet  Google Scholar 

  42. A. Steger, unpublished manuscript, Technische Universität München, 1999.

    Google Scholar 

  43. W.T. Trotter, Applications of the probabilistic method to partially ordered sets, in The mathematics of Paul Erdös II (R.L. Graham and J. Nešetřil, eds.), Algorithms and Combinatorics, Vol. 14, Springer-Verlag, 214–228, 1997.

    Google Scholar 

  44. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Humboldt-Universität zu Berlin, D-10099, Berlin

    Hans Jürgen Prömel & Anusch Taraz

Authors
  1. Hans Jürgen Prömel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anusch Taraz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Freie Universität Berlin, Takustr. 9, 14195, Berlin, Germany

    Helmut Alt

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Prömel, H.J., Taraz, A. (2001). Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. In: Alt, H. (eds) Computational Discrete Mathematics. Lecture Notes in Computer Science, vol 2122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45506-X_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45506-X_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42775-9

  • Online ISBN: 978-3-540-45506-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation