Brualdi, Richard A
Introductory combinatorics - 5 - Noida Pearson 2020 - 604 p.
Covers a wide range of topics
A clear and accessible presentation, written from the students perspective, facilitates understanding of basic concepts and principles
An excellent treatment of Pólyas Counting Theorem that does not assume students have studied group theory.
Many worked examples illustrate methods used
9789353433062
Combinatorial analysis
Computer science--Mathematics
511.6 / BRU/I
Introductory combinatorics - 5 - Noida Pearson 2020 - 604 p.
Covers a wide range of topics
A clear and accessible presentation, written from the students perspective, facilitates understanding of basic concepts and principles
An excellent treatment of Pólyas Counting Theorem that does not assume students have studied group theory.
Many worked examples illustrate methods used
9789353433062
Combinatorial analysis
Computer science--Mathematics
511.6 / BRU/I