Introductory Combinatorics, 5e

Price:

NPR 1,095.00


Ships from Overseas

Introductory Combinatorics, 5e

This trusted best-seller covers the key combinatorial including the pigeon-hole principle, counting techniques, Permutations and Combinations, pólya counting, Binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatorial structures (matching, designs, graphs), and flows in networks.

NPR 1,095.00 1095.0 NPR NPR 1,216.00

NPR 1,216.00


  • Author
  • Pages
  • Pages 624
  • Year
  • ISBN
  • Publisher
  • Language
  • Subject
  • Edition
  • Weight
  • Dimensions
  • Binding

This combination is not available.

Not in Stock. Ships in: 4-6 weeks
Details

Share :

Introductory Combinatorics, 5e

This trusted best-seller covers the key combinatorial including the pigeon-hole principle, counting techniques, Permutations and Combinations, pólya counting, Binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatorial structures (matching, designs, graphs), and flows in networks. The 5th edition incorporates feedback from users to the exposition throughout and adds a wealth of new exercises. 

Features: 
  • Covers a wide range of topics: -dilworth's theorem -partitions of Integers -counting sequences and generating functions -Extensive graph theory coverage 
  • a clear and accessible presentation, written from the student's perspective, facilitates understanding of basic concepts and principles. 
  • An excellent treatment of pólya’s counting theorem that does not assume students have studied group theory. 
  • Many worked examples illustrate methods used. 
Table of Contents: 

Chapter 1. What is combinatorics 

Chapter 2. The pigeonhole principle 

Chapter 3. Permutations and Combinations 

Chapter 4. Generating Permutations and Combinations 

Chapter 5. The Binomial coefficients 

Chapter 6. The inclusion-exclusion principle and applications 

Chapter 7. Recurrence relations and generating functions 

Chapter 8. Systems of distinct representatives 

Chapter 10. Combinatorial designs 

Chapter 11. Introduction to graph theory 

Chapter 12. More on graph theory

 Chapter 13. Digraphs and networks 

Chapter 14. Pólya counting

Book
Author Brualdi
Pages 624
Year 2019
ISBN 9789353433062
Publisher Pearson
Language English
Uncategorized
Subject Computer Science / Automata Theory
Edition 5/e
Weight 1 kg
Dimensions 24.4 x 20.3 x 3.7 cm
Binding Paperback