Damian Brunold

Norman L. Biggs: Discrete Mathematics

Mathe

Inhaltsverzeichnis

  1. Integers
  2. Functions and counting
  3. Principles of counting
  4. Subsets and designs
  5. Partition, classification, and distribution
  6. Modular arithmetic
  7. Algorithms and their efficiency
  8. Graphs
  9. Trees, sorting, and searching
  10. Bipartite graphs and matching problems
  11. Digraphs, networks, and flows
  12. Recursive techniques
  13. Groups
  14. Groups of permutations
  15. Rings, field, and permutations
  16. Finite fields and some applications
  17. Error-correcting codes
  18. Generating functions
  19. Partitions of a positive integer
  20. Symmetry and counting

Amazon.deAmazon.com