Skip to main content
SpringerLink
Log in

Nine lectures on random graphs

  • Conference paper
  • First Online:
Ecole d'Eté de Probabilités de Saint-Flour XXI - 1991

Part of the book series: Lecture Notes in Mathematics ((LNMECOLE,volume 1541))

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
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

  • N. Alon and Z. Bregman (1988), Every 8-uniform 8-regular hypergraph is 2-colorable, Graphs and Combinatorics 4, 303–305.

    Article  MathSciNet  MATH  Google Scholar 

  • B. Bollobás (1985), Random Graphs, Academic Press.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • B. Bollobás and P. Erdös (1976), Cliques in Random Graphs, Math. Proc. Camb. Phil. Soc. 80, 419–427

    Article  MathSciNet  MATH  Google Scholar 

  • R. B. Boppana and J. H. Spencer (1989), A useful elementary correlation inequality, J. Combinatorial Theory Ser. A, 50, 305–307.

    Article  MathSciNet  MATH  Google Scholar 

  • P. Erdös (1947), Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53, 292–294.

    Article  MathSciNet  MATH  Google Scholar 

  • P. Erdös (1956), Problems and results in additive number theory, Colloque sur le Théorie des Nombres (CBRM, Bruselles) 127–137

    Google Scholar 

  • P. Erdös (1959), Graph theory and probability, Canad. J. Math. 11 (1959), 34–38.

    Article  MathSciNet  MATH  Google Scholar 

  • P. Erdös and M. Kac (1940), The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions, Amer. J. Math. 62, 738–742

    Article  MathSciNet  MATH  Google Scholar 

  • P. Erdös and L. Lovász (1975), Problems and results on 3-chromatic hypergraphs and some related questions, in: Infinite and Finite Sets (A. Hajnal et al., eds.), North-Holland, Amsterdam, pp. 609–628.

    Google Scholar 

  • P. Erdös and A. Rényi (1960), On the Evolution of Random Graphs, Mat Kutató Int. Közl. 5, 17–60

    MathSciNet  MATH  Google Scholar 

  • P. Erdös and J. Spencer (1991), Lopsided Lovász Local Lemma and Latin Transversals, Disc. Appl. Math. 30, 151–154

    Article  MATH  Google Scholar 

  • P. Erdös and G. Szekeres (1935), A Combinatorial Problem in Geometry, Compositio Math. 2, 463–470

    MathSciNet  MATH  Google Scholar 

  • P. Erdös and P. Tetali (1990), Representations of integers as the Sum of k Terms, Random Structures and Algorithms 1, 245–261.

    Article  MathSciNet  MATH  Google Scholar 

  • R. Fagin (1976), Probabilities in Finite Models, J. Symbolic Logic 41, 50–58

    Article  MathSciNet  MATH  Google Scholar 

  • Y.V. Glebskii, D.I. Kogan, M.I. Liagonkii and V.A. Talanov (1969), Range and degree of realizability of formulas the restricted predicate calculus, Cybernetics 5, 142–154 (Russian original: Kibernetica 5, 1969, 17–27)

    Article  Google Scholar 

  • L. Harper (1966), Optimal numberings and isoperimetric problems on graphs, J. Combinatorial Theory 1, 385–394.

    Article  MathSciNet  MATH  Google Scholar 

  • S. Janson, T. Łuczak, A. Rucinski (1990), An Exponential Bound for the Probability of Nonexistence of a Specified Subgraph in a Random Graph, in Random Graphs '87 (M. Karonski, J. Jaworski, A. Rucinski, eds.), John Wiley, 73–87

    Google Scholar 

  • R.M. Karp (1990), The transitive closure of a Random Digraph, Random Structures and Algorithms 1, 73–94

    Article  MathSciNet  MATH  Google Scholar 

  • T. Łuczak (1990), Component Behavior near the Critical Point of the Random Graph Process, Random Structures and Algorithms 1, 287–310.

    Article  MathSciNet  MATH  Google Scholar 

  • P. Mani-Levitska and J. Pach (1988), Decomposition problems for multiple coverings with unit balls, to appear.

    Google Scholar 

  • D.W. Matula (1976), The Largest Clique Size in a Random Graph, Tech. Rep. Dept. Comp. Sci. Southern Methodist University, Dallas

    Google Scholar 

  • B. Maurey (1979), Construction de suites symétriques, Compt. Rend. Acad. Sci. Paris 288, 679–681.

    MathSciNet  MATH  Google Scholar 

  • V. D. Milman and G. Schechtman (1986), Asymptotic Theory of Finite Dimensional Normed Spaces, Lecture Notes in Mathematics 1200, Springer Verlag, Berlin and New York.

    MATH  Google Scholar 

  • E. Shamir and J. Spence (1987), Sharp concentration of the chromatic number in random graphs G n,p , Combinatorica 7, 121–130

    Article  MathSciNet  Google Scholar 

  • J. Shearer (1985), On a problem of Spencer, Combinatorica 5, 241–245.

    Article  MathSciNet  MATH  Google Scholar 

  • S. Shelah and J. Spencer (1988), Zero-One Laws for Sparse Random Graphs, J. Amer. Math. Soc. 1, 97–115

    Article  MathSciNet  MATH  Google Scholar 

  • J. Spencer (1977), Asymptotic Lower Bounds for Ramsey Functions, Disc. Math. 20, 69–76

    Article  MathSciNet  MATH  Google Scholar 

  • J. Spencer (1990a), Threshold Functions for Extension Statements, J. Comb. Th. (Ser A) 53, 286–305

    Article  MathSciNet  MATH  Google Scholar 

  • J. Spencer (1990b), Counting Extension, J. Combinatorial Th. (Ser A) 55, 247–255.

    Article  MATH  Google Scholar 

  • P. Turán (1934), On a theorem of Hardy and Ramanujan, J. London Math Soc. 9, 274–276

    Article  MathSciNet  MATH  Google Scholar 

  • E.M. Wright (1977), The number of connected sparsely edged graphs, Journal of Graph Theory 1, 317–330.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Courant Institute of Mathematical Sciences, 251 Mercer Street, 10012, New York, NY, U.S.A.

    Joel Spencer

Authors
  1. Joel Spencer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul-Louis Hennequin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag

About this paper

Cite this paper

Spencer, J. (1993). Nine lectures on random graphs. In: Hennequin, PL. (eds) Ecole d'Eté de Probabilités de Saint-Flour XXI - 1991. Lecture Notes in Mathematics, vol 1541. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0084192

Download citation

  • DOI: https://doi.org/10.1007/BFb0084192

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47608-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation