The theory of matroids connects disparate branches of combinatorial theory and algebra such as graph and lattice theory, combinatorial optimization, and linear algebra. Aimed at advanced undergraduate and graduate students, this text is one of the earliest substantial works on matroid theory. Its aut... read more
Customers who bought this book also bought:
Our Editors also recommend:
Introduction to Graph Theory by Richard J. Trudeau Aimed at "the mathematically traumatized," this text offers nontechnical coverage of graph theory, with exercises. Discusses planar graphs, Euler's formula, Platonic graphs, coloring, the genus of a graph, Euler walks, Hamilton walks, more. 1976 edition.
Introductory Graph Theory by Gary Chartrand Clear, lively style covers all basics of theory and application, including mathematical models, elementary graph theory, transportation problems, connection problems, party problems, diagraphs and mathematical models, games and puzzles, more.
Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou, Kenneth Steiglitz This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.
Lattice Theory: First Concepts and Distributive Lattices by George Grätzer This outstanding text is written in clear language and enhanced with many exercises, diagrams, and proofs. It discusses historical developments and future directions and provides an extensive bibliography and references. 1971 edition.
Foundations of Combinatorics with Applications by Edward A. Bender, S. Gill Williamson Suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics, this introductory text explores counting and listing, graphs, induction and recursion, and generating functions. Includes numerous exercises (some with solutions), notes, and references.
Introduction to Combinatorial Analysis by John Riordan Introductory text surveys the theory of permutations and combinations associated with elementary algebra; the principle of inclusion and exclusion; and the theory of distributions and partitions in cyclic representation. Includes problems. 1958 edition.
Optimization Theory with Applications by Donald A. Pierre Broad-spectrum approach to important topic. Explores the classic theory of minima and maxima, classical calculus of variations, simplex technique and linear programming, optimality and dynamic programming, more. 1969 edition.
Analytical Methods of Optimization by D. F. Lawden Suitable for advanced undergraduates and graduate students, this text surveys the classical theory of the calculus of variations. Topics include static systems, control systems, additional constraints, the Hamilton-Jacobi equation, and the accessory optimization problem. 1975 edition.
Variational Methods in Optimization by Donald R. Smith Highly readable text elucidates applications of the chain rule of differentiation, integration by parts, parametric curves, line integrals, double integrals, and elementary differential equations. 1974 edition.
Linear Algebra by Georgi E. Shilov Covers determinants, linear spaces, systems of linear equations, linear functions of a vector argument, coordinate transformations, the canonical form of the matrix of a linear operator, bilinear and quadratic forms, and more.
Modern Algebra by Seth Warner Standard text provides an exceptionally comprehensive treatment of every aspect of modern algebra. Explores algebraic structures, rings and fields, vector spaces, polynomials, linear operators, much more. Over 1,300 exercises. 1965 edition.
Basic Algebra I: Second Edition by Nathan Jacobson A classic text and standard reference for a generation, this volume covers all undergraduate algebra topics, including groups, rings, modules, Galois theory, polynomials, linear algebra, and associative algebra. 1985 edition.
Basic Algebra II: Second Edition by Nathan Jacobson This classic text and standard reference comprises all subjects of a first-year graduate-level course, including in-depth coverage of groups and polynomials and extensive use of categories and functors. 1989 edition.
The theory of matroids connects disparate branches of combinatorial theory and algebra such as graph and lattice theory, combinatorial optimization, and linear algebra. Aimed at advanced undergraduate and graduate students, this text is one of the earliest substantial works on matroid theory. Its author, D. J. A. Welsh, Professor of Mathematics at Oxford University, has exercised a profound influence over the theory's development. The first half of the text describes standard examples and investigation results, using elementary proofs to develop basic matroid properties and referring readers to the literature for more complex proofs. The second half advances to a more sophisticated treatment, addressing a variety of research topics. Praised by the Bulletin of the American Mathematical Society as "a useful resource for both the novice and the expert," this text features numerous helpful exercises.
Reprint of the Academic Press, London, 1976 edition.
This book was printed in the United States of America.
Dover books are made to last a lifetime. Our US book-manufacturing partners produce the highest quality books in the world and they create jobs for our fellow citizens. Manufacturing in the United States also ensures that our books are printed in an environmentally friendly fashion, on paper sourced from responsibly managed forests.