Applied Combinatorics, Third Edition
3rd Edition
Published on 31. December 2023
Book
Hardback
750 pages
978-1-4987-8130-5 (ISBN)
Description
The third edition of this popular text presents the tools of combinatorics for a first undergraduate course. After introducing fundamental counting rules, tools of graph theory and relations, the focus is on three basic problems of combinatorics: counting, existence, and optimization problems. They discuss advanced tools for dealing with the counting problem, including generating functions, recurrences, inclusion/exclusion, and Polya theory. Combinatorial design, coding theory, and special problems in graph theory are also covered. It also illustrates the basic ideas of combinatorial optimization through a study of graphs and networks. The authors present many contemporary applications.
More details
Edition
3rd edition
Language
English
Place of publication
Portland
United States
Publishing group
Taylor & Francis Inc
Target group
College/higher education
Illustrations
300 s/w Abbildungen
300 Illustrations, black and white
Dimensions
Height: 234 mm
Width: 156 mm
ISBN-13
978-1-4987-8130-5 (9781498781305)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
Previous edition
Fred Roberts | Barry Tesman
Applied Combinatorics
Book
06/2009
2nd Edition
Chapman & Hall/CRC
€181.50
Article exhausted; check for reprint
Persons
Fred S. Roberts is Distinguished Professor, Department of Mathematics, Rutgers University, New Brunswick, NJ; Director Emeritus and Special Advisor of DIMACS, Center for Discrete Mathematics and Theoretical Computer Science; Director of Department of Homeland Security Center of Excellence CCICADA: Command, Control and Interoperability Center for Advanced Data Analysis; Fellow of RUTCOR, Rutgers Center for Operations Research, New Brunswick, NJ.; Member of Graduate Faculties in Mathematics, Operations Research, Computer Science, Computational Molecular Biology, Computational Biology and Molecular Biophysics, Education, and Industrial and Systems Engineering at Rutgers University; Chair, Rutgers University Homeland Security Research Initiative (RUHSRI); Co-Chair, NJ Universities Consortium for Homeland Security Research Barry Tesman is Professor of Mathematics at Dickinson College.
Content
Chapter 1: What Is Combinatorics? THE BASIC TOOLS OF COMBINATORICS Chapter 2: Basic Counting Rules; Chapter 3: Introduction to Graph Theory; Chapter 4 Relations; THE COUNTING PROBLEM Chapter 5: Generating Functions and Their Applications; Chapter 6: Recurrence Relations; Chapter 7: The Principle of Inclusion and Exclusion; Chapter 8: The Polya Theory of Counting; THE EXISTENCE PROBLEM Chapter 9: Combinatorial Designs; Chapter 10: Coding Theory; Chapter 11: Existence Problems in Graph Theory; COMBINATORIAL OPTIMIZATION Chapter 12: Matching and Covering; Chapter 13: Optimization Problems for Graphs and Networks; Appendix: Answers to Selected Exercises; Author Index; Subject Index; References appear at the end of each chapter.