Combinatorics - Topics, Techniques, Algorithms

Klappentext Including many algorithms described in simple terms! this book stresses common techniques (such as generating functions and recursive construction) that underlie the great variety of subject matter. Zusammenfassung A textbook in combinatorics for second-year undergraduate to beginning graduate students. Inhaltsverzeichnis Preface; 1. What is combinatorics?; 2. On numbers and counting; 3. Subsets, partitions, permutations; 4. Recurrence relations and generating functions; 5. The principle of inclusion and exclusion; 6. Latin squares and SDRs; 7. Extremal set theory; 8. Steiner triple theory; 9. Finite geometry; 10. Ramsey's theorem; 11. Graphs; 12. Posets, lattices and matroids; 13. More on partitions and permutations; 14. Automorphism groups and permutation groups; 15. Enumeration under group action; 16. Designs; 17. Error-correcting codes; 18. Graph colourings; 19. The infinite; 20. Where to from here?; Answers to selected exercises; Bibliography; Index.

Product details

• Authors: Cameron, Peter J. Cameron, Cameron Peter J.
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Paperback / Softback
• Released: 06.10.1994
• EAN: 9780521457613
• ISBN: 978-0-521-45761-3
• No. of pages: 368
• Subjects: Natural sciences, medicine, IT, technology > Mathematics > Miscellaneous; MATHEMATICS / Discrete Mathematics, Combinatorics & graph theory, Combinatorics and graph theory