Combinatorial Methods in Discrete Mathematics
Series: Encyclopedia of Mathematics and its Applications; 55;
- Publisher's listprice GBP 56.00
-
26 754 Ft (25 480 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 5 351 Ft off)
- Discounted price 21 403 Ft (20 384 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
26 754 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 2 June 2011
- ISBN 9780521172769
- Binding Paperback
- No. of pages322 pages
- Size 234x156x17 mm
- Weight 450 g
- Language English 0
Categories
Short description:
A 1996 account of some complex problems of discrete mathematics in a simple and unified form.
MoreLong description:
Originally published in 1996, this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, which are considered in Chapter 3. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate.
Review of the hardback: ' ... a very enjoyable and brisk introduction to the exciting fields of enumerative and probabilistic combinatorics'. B. Bollob&&&225;s, Bulletin of the London Mathematical Society
Table of Contents:
Preface; Preface to the English edition; Introduction; 1. Combinatorial configurations; 2. Transversals and permanents; 3. Generating functions; 4. Graphs and mappings; 5. The general combinatorial scheme; 6. Polya's theorem and its applications; Bibliography; Index.
More
Homogenization of Differential Operators and Integral Functionals
35 481 HUF
32 643 HUF
