Regular price €56.99
A01=Alan Slomson
A01=R.B.J.T. Allenby
Age Group_Uncategorized
Age Group_Uncategorized
Author_Alan Slomson
Author_R.B.J.T. Allenby
automatic-update
C10 C11 C12 C13 C14
C4 C5 C6 C7 C8
C5 C6 C7 C8
C5 C6 C7 C8 C9
Catalan numbers
Category1=Non-Fiction
Category=PBV
Cayley Table
Closed Path
combinatorics
Connected Graph
COP=United Kingdom
counting problems
Cycle Type
Delivery_Pre-order
Dirichlet’s pigeonhole principle
Disjoint Cycles
Dot Diagram
dot diagrams
eq_isMigrated=2
eq_new_release
Equilateral Triangle
Fibonacci numbers
four-color problem
generating functions
graph theory
Group Action
Hall’s Marriage Theorem
Hamiltonian Path
inclusion-exclusion principle
Königsberg bridges problem
K�Nigsberg Bridges Problem
Language_English
Minimal Connector
Nonnegative Integer Solutions
occupancy problems
PA=Not yet available
permutations
Pigeonhole Principle
Planar Graph
Positive Integer
Price_€50 to €100
PS=Forthcoming
Pólya’s counting theorem
P�Lya�S Counting Theorem
Ramsey theory
Recurrence Relation
recurrence relations
rook polynomials
Rotational Symmetries
Sequence D1
Short Path
softlaunch
Stirling Numbers
trees
Vice Versa

Product details

  • ISBN 9781032919775
  • Weight: 830g
  • Dimensions: 178 x 254mm
  • Publication Date: 14 Oct 2024
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Paperback
  • Language: English
Delivery/Collection within 10-20 working days

Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock

10-20 Working Days
: On Backorder

Will Deliver When Available
: On Pre-Order or Reprinting

We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!

Emphasizes a Problem Solving Approach
A first course in combinatorics

Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics.

New to the Second Edition
This second edition incorporates 50 percent more material. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet’s pigeonhole principle, Ramsey theory, and rook polynomials. This edition also contains more than 450 exercises.

Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and Pólya’s counting theorem.

Alan Slomson taught mathematics at the University of Leeds from 1967 to 2008. He is currently the secretary of the United Kingdom Mathematics Trust.

R.B.J.T. Allenby taught mathematics at the University of Leeds from 1965 to 2007.