Free delivery for orders over 69.99 euro.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 69.99 €

DPD courier 5.99 € Bpost point 7.99 € Bpost 7.49 € DPD point 3.49 € GLS courier 4.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99 euro.

Combinatorial Methods in Discrete Mathematics

Name: Combinatorial Methods in Discrete Mathematics
Brand: Cambridge University Press
SKU: 02031522
Price: 159.04 EUR
Availability: InStock
Author: Vladimir N. Sachkov
ISBN: 9780521455138

Vladimir N. Sachkov

Language

English

Book Hardback

Libristo code: 02031522

Publishers Cambridge University Press, January 1996

Originally published in 1996, this is a presentation of some complex problems of discrete mathematic... Full description

Libristo code: 02031522

385 b

159.04 €

In stock at our supplier Shipping in 9-15 days

Up to 30 days for returns

Customers also purchased

Anička a cirkus Ivana Peroutková

Audio CD

2.82 €

Sonnenuntergang am Jade-Weser-Port (Puzzle) Steffani Lehmann

Game

34.37 €

El Oraculo de la Diosa: Un Camino Hacia la Totalidad A Traves de la Diosa y el Ritual [With 52 Cards] = The Goddess Oracle Amy Sophia Marashinsky

Paperback

27.09 €

Robuste Planung Und Optimierung Armin Scholl

Paperback

134.57 €

Meine Reise Nach Den Strafkolonien Robert Heindl

Paperback

44.48 €

Vango - Un prince sans royaume. Vango - Prinz ohne Königreich, französische Ausgabe Timothée de Fombelle

Paperback

26.38 €

Poesie...

Hardback

30.73 €

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.