Skip to content

Random Graphs


Part of Encyclopedia of Mathematics and its Applications

  • Date Published: September 2009
  • availability: Available
  • format: Paperback
  • isbn: 9780521119689

£ 44.99

Add to cart Add to wishlist

Other available formats:
Hardback, eBook

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • This book is devoted to the study of classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields. The author shows how the application of the generalized scheme of allocation in the study of random graphs and permutations reduces the combinatorial problems to classical problems of probability theory on the summation of independent random variables. He concentrates on research by Russian mathematicians, including a discussion of equations containing an unknown permutation and a presentation of techniques for solving systems of random linear equations in finite fields. These results will interest specialists in combinatorics and probability theory and will also be useful in applied areas of probabilistic combinatorics such as communication theory, cryptology, and mathematical genetics.

    • Presents many important Russian results in English
    • Unified approach shows connections between combinatorial problems, graph theory, and classical probability theory
    Read more

    Reviews & endorsements

    Review of the hardback: 'Many of the results appear here for the first time in an English translation. The book is therefore to be welcomed for bringing this material to a wider audience.' W. T. Gowers, Bulletin of the London Mathematical Society

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: September 2009
    • format: Paperback
    • isbn: 9780521119689
    • length: 268 pages
    • dimensions: 234 x 156 x 14 mm
    • weight: 0.38kg
    • availability: Available
  • Table of Contents

    1. The generalized scheme of allocation and the components of random graphs
    2. Evolution of random graphs
    3. Systems of random linear equations in GF(2)
    4. Random permutations
    5. Equations containing an unknown permutation

  • Author

    V. F. Kolchin, Steklov Institute of Mathematics, Moscow

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.