Overview
This work explores the role of probabilistic methods for solving combinatorial problems. The subjects studied are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these define the probabilistic setting of Sachkov's general combinatorial scheme. The author pays special attention to using probabilistic methods to obtain asymptotic formulae that are difficult to derive using combinatorial methods. This important book describes many ideas not previously available in English and will be of interest to graduate students and professionals in mathematics and probability theory.
- | Author: V. N. Sachkov
- | Publisher: Cambridge University Press
- | Publication Date: May 15, 1997
- | Number of Pages: 260 pages
- | Binding: Hardback or Cased Book
- | ISBN-10: 052145512X
- | ISBN-13: 9780521455121
