Listing 1 - 3 of 3 |
Sort by
|
Choose an application
Choose an application
This book covers a wide variety of topics in combinatorics and graph theory. It includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. In addition, recent results appear in the text, illustrating the fact that mathematics is a living discipline. The second edition includes many new topics and features: • New sections in graph theory on distance, Eulerian trails, and Hamiltonian paths. • New material on partitions, multinomial coefficients, and the pigeonhole principle. • Expanded coverage of Pólya Theory to include de Bruijn’s method for counting arrangements when a second symmetry group acts on the set of allowed colors. • Topics in combinatorial geometry, including Erdos and Szekeres’ development of Ramsey Theory in a problem about convex polygons determined by sets of points. • Expanded coverage of stable marriage problems, and new sections on marriage problems for infinite sets, both countable and uncountable. • Numerous new exercises throughout the book. About the First Edition: ". . . this is what a textbook should be! The book is comprehensive without being overwhelming, the proofs are elegant, clear and short, and the examples are well picked." — Ioana Mihaila, MAA Reviews.
Análisis combinatorio --- Grafos, Teoría de --- Discrete mathematics --- Combinatorial analysis --- Graph theory --- Combinatorial analysis. --- Graph theory. --- Discrete mathematics. --- Combinatorics. --- Mathematical logic. --- Discrete Mathematics. --- Mathematical Logic and Foundations. --- Combinatorics --- Algebra --- Mathematical analysis --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism
Choose an application
Three things should be considered: problems, theorems, and applications. - Gottfried Wilhelm Leibniz, Dissertatio de Arte Combinatoria, 1666 This book grew out of several courses in combinatorics and graph theory given at Appalachian State University and UCLA in recent years. A one-semester course for juniors at Appalachian State University focusing on graph theory covered most of Chapter 1 and the first part of Chapter 2. A one-quarter course at UCLA on combinatorics for undergraduates concentrated on the topics in Chapter 2 and included some parts of Chapter I. Another semester course at Appalachian State for advanced undergraduates and beginning graduate students covered most of the topics from all three chapters. There are rather few prerequisites for this text. We assume some familiarity with basic proof techniques, like induction. A few topics in Chapter 1 assume some prior exposure to elementary linear algebra. Chapter 2 assumes some familiarity with sequences and series, especially Maclaurin series, at the level typically covered in a first-year calculus course. The text requires no prior experience with more advanced subjects, such as group theory.
Combinatorial analysis --- Graph theory --- Combinatorial analysis. --- Graph theory. --- Combinatorics. --- Combinatorics --- Algebra --- Mathematical analysis
Listing 1 - 3 of 3 |
Sort by
|