Invitation to Discrete Mathematics
Seiten
1998
Clarendon Press (Verlag)
978-0-19-850208-1 (ISBN)
Clarendon Press (Verlag)
978-0-19-850208-1 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Zu diesem Artikel existiert eine Nachauflage
This is an introduction and a comprehensive textbook for courses in combinatorics and graph theory. It also contains introductory chapters for more specialised courses such as probabilistic methods, applied linear algebra, combinatorial enumeration, and operations research.
This book is a clear and self-contained introduction to discrete mathematics, and in particular to combinatorics and graph theory. Aimed at undergraduates and early graduate students in mathematics and computer science, it is written with the goal of stimulating interest in mathematics and encourages an active, problem-solving approach to the material. The reader is led to an understanding of the basic principles and methods of actually doing mathematics. It is more narrowly focused than many discrete mathematics textbooks and treats selected topics in unusual depth and from several points of view. The book reflects the conviction of the authors, active and internationally renowned mathematicians, that the most important gain from studying mathematics is the cultivation of clear and logical thinking and habits, invariably useful for attacking new problems. More than 400 exercises, ranging widely in difficulty, and many accompanied by hints for solution, support this approach to teaching. Readers will appreciate the lively and informal style of the text, accompanied by more than 200 drawings and diagrams.
Specialists in various parts of science ( with a basic mathematical education) wishing to apply discrete mathematics in their field will find the book a useful source, and even experts in combinatorics may occasionally learn from pointers to research literature or from the presentation of recent results. Invitation to Discrete Mathematics should make delightful reading both for beginners and mathematical professionals.
This book is a clear and self-contained introduction to discrete mathematics, and in particular to combinatorics and graph theory. Aimed at undergraduates and early graduate students in mathematics and computer science, it is written with the goal of stimulating interest in mathematics and encourages an active, problem-solving approach to the material. The reader is led to an understanding of the basic principles and methods of actually doing mathematics. It is more narrowly focused than many discrete mathematics textbooks and treats selected topics in unusual depth and from several points of view. The book reflects the conviction of the authors, active and internationally renowned mathematicians, that the most important gain from studying mathematics is the cultivation of clear and logical thinking and habits, invariably useful for attacking new problems. More than 400 exercises, ranging widely in difficulty, and many accompanied by hints for solution, support this approach to teaching. Readers will appreciate the lively and informal style of the text, accompanied by more than 200 drawings and diagrams.
Specialists in various parts of science ( with a basic mathematical education) wishing to apply discrete mathematics in their field will find the book a useful source, and even experts in combinatorics may occasionally learn from pointers to research literature or from the presentation of recent results. Invitation to Discrete Mathematics should make delightful reading both for beginners and mathematical professionals.
1. Introduction and basic concepts; 2. Combinatorial counting; 3. Graphs: an introduction; 4. Trees; 5. Drawing graphs in the plane; 6. Double-counting; 7. The number of spanning trees; 8. Finite projective planes; 9. Probability and probabilistic proofs; 10. Generating functions; 11. Applications of linear algebra; Appendix: Prerequisites from algebra; Bibliography; Hints to selected exercises; Index
Erscheint lt. Verlag | 23.7.1998 |
---|---|
Co-Autor | Jaroslav Nesetril |
Zusatzinfo | 20 halftones, 225 line figures, bibliography, index |
Verlagsort | Oxford |
Sprache | englisch |
Maße | 156 x 234 mm |
Gewicht | 881 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
Mathematik / Informatik ► Mathematik ► Algebra | |
Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
Mathematik / Informatik ► Mathematik ► Graphentheorie | |
ISBN-10 | 0-19-850208-7 / 0198502087 |
ISBN-13 | 978-0-19-850208-1 / 9780198502081 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Teil 2 der gestreckten Abschlussprüfung : Fachinformatiker-/in …
Buch | Softcover (2023)
Europa-Lehrmittel (Verlag)
22,90 €
Buch | Hardcover (2021)
Springer Berlin (Verlag)
69,99 €