This book fills a need for a thorough introduction to graph theory that features both the understanding and writing of proofs about graphs. Verification that algorithms work is emphasized more than their complexity. An effective use of examples, and huge number of interesting exercises, demonstrate the topics of trees and distance, matchings and factors, connectivity and paths, graph coloring, edges and cycles, and planar graphs. For those who need to learn to make coherent arguments in the fields of mathematics and computer science.
This survey of both discrete and continuous mathematics focuses on the logical thinking skills necessary to understand and communicate fundamental ideas and proofs in mathematics, rather than on rote symbolic manipulation. Coverage begins with the fundamentals of mathematical language and proof techniques (such as induction); then applies them to easily-understood questions in elementary number theory and counting; then develops additional techniques of proofs via fundamental topics in discrete and continuous mathematics. Topics are addressed in the context of familiar objects; easily-understood, engaging examples; and over 700 stimulating exercises and problems, ranging from simple applications to subtle problems requiring ingenuity. ELEMENTARY CONCEPTS. Numbers, Sets and Functions. Language and Proofs. Properties of Functions. Induction. PROPERTIES OF NUMBERS. Counting and Cardinality. Divisibility. Modular Arithmetic. The Rational Numbers. DISCRETE MATHEMATICS. Combinatorial Reasoning. Two Principles of Counting. Graph Theory. Recurrence Relations. CONTINUOUS MATHEMATICS. The Real Numbers. Sequences and Series. Continuity. Differentiation. Integration. The Complex Numbers. For anyone interested in learning how to understand and write mathematical proofs, or a reference for college professors and high school teachers of mathematics.