Random graphs
by V. F. Kolchin
- 1 Want to read
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.
Check nearby libraries
Buy this book
Subjects
Random graphs, Graph theory| Edition | Availability |
|---|---|
1
|
zzzz
|
|
2
|
zzzz
|
|
3
|
zzzz
|
4
|
aaaa
|
|
5
|
zzzz
|
Book Details
Edition Notes
Includes bibliographical references (p. [241]-249) and index.
Classifications
External Links
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
History
- Created April 1, 2008
- 16 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| July 20, 2025 | Edited by MARC Bot | import existing book |
| March 28, 2025 | Edited by ImportBot | Redacting ocaids |
| July 9, 2024 | Edited by MARC Bot | import existing book |
| November 28, 2020 | Edited by MARC Bot | import existing book |
| April 1, 2008 | Created by an anonymous user | Imported from Scriblio MARC record |