Combinatorial Methods in Discrete Mathematics: 55 (Encyclopedia of Mathematics and its Applications, Series Number 55) - Image 1

£92.33

Cambridge University Press Combinatorial Methods in Discrete Mathematics: 55 (Encyclopedia of Mathematics and its Applications, Series Number 55)

Name: Combinatorial Methods in Discrete Mathematics: 55 (Encyclopedia of Mathematics and its Applications, Series Number 55)
Brand: Cambridge University Press
Price: 92.33 GBP
Availability: InStock

Combinatorics & Graph Theory

Cheaper than 58% of the days we've watched it. Below what most people pay.

£92 today · 30-day average £97 · all-time low £66

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 89 days • 89 data points

Historical

Generating forecast...

Price Distribution

Price distribution over 89 days • 4 price levels

Days at Price

Current Price

Price Analysis

Most common price: £66 (37 days, 41.6%)

Price range: £66 - £109

Price levels: 4 different prices over 89 days

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.

Product Specifications

Brand: Cambridge University Press
Format: hardcover
ASIN: 0521455138
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Combinatorics & Graph Theory
Domain: Amazon UK
Release Date: 11 January 1996
Listed Since: 16 December 2006

Barcode

No barcode data available

Cambridge University Press Combinatorial Methods in Discrete Mathematics: 55 (Encyclopedia of Mathematics and its Applications, Series Number 55)

Cheaper than 58% of the days we've watched it. Below what most people pay.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Combinatorics, Automata and Number Theory: 135 (Encyclopedia of Mathematics and its Applications, Series Number 135)

Elementary Number Theory, Group Theory and Ramanujan Graphs: 55 (London Mathematical Society Student Texts, Series Number 55)

Probabilistic Methods for Algorithmic Discrete Mathematics: 16 (Algorithms and Combinatorics, 16)

Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60)

Surveys in Combinatorics 2007: 346 (London Mathematical Society Lecture Note Series, Series Number 346)

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

Surveys in Combinatorics, 1989: Invited Papers At The Twelfth British Combinatorial Conference: 141 (London Mathematical Society Lecture Note Series, Series Number 141)

Noncommutative Rational Series with Applications: 137 (Encyclopedia of Mathematics and its Applications, Series Number 137)

Discrete Maths Software Engineers: An Introduction for Software Engineers

An Invitation to Analytic Combinatorics: From One to Several Variables (Texts & Monographs in Symbolic Computation)

Combinatorial Geometries: 29 (Encyclopedia of Mathematics and its Applications, Series Number 29)

Complexity: Knots, Colourings and Countings: 186 (London Mathematical Society Lecture Note Series, Series Number 186)

Matroid Applications: 40 (Encyclopedia of Mathematics and its Applications, Series Number 40)

Fete of Combinatorics and Computer Science: 20 (Bolyai Society Mathematical Studies, 20)

The Theory of Finite Linear Spaces: Combinatorics of Points and Lines

Recent Trends in Combinatorics: The Legacy of Paul Erdős

Patterns in Permutations and Words (Monographs in Theoretical Computer Science. An EATCS Series)

Investigations in Algebraic Theory of Combinatorial Objects: 84 (Mathematics and its Applications, 84)

Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)

Mathematical Properties of Sequences and Other Combinatorial Structures: 726 (The Springer International Series in Engineering and Computer Science, 726)

Nonnegative Matrices and Applications: 64 (Encyclopedia of Mathematics and its Applications, Series Number 64)

Design Theory: Volume 2: 78 (Encyclopedia of Mathematics and its Applications, Series Number 78)

Mathematical Theory of Optimization: 56 (Nonconvex Optimization and Its Applications, 56)

Counting with Symmetric Functions: 43 (Developments in Mathematics, 43)