# Search Results for "theory-of-matroids-encyclopedia-of-mathematics-and-its-applications"

## Theory of Matroids

**Author**: Neil White**Publisher:**Cambridge University Press**ISBN:**0521309379**Category:**Mathematics**Page:**316**View:**1860

The theory of matroids is unique in the extent to which it connects such disparate branches of combinatorial theory and algebra as graph theory, lattice theory, design theory, combinatorial optimization, linear algebra, group theory, ring theory and field theory. Furthermore, matroid theory is alone among mathematical theories because of the number and variety of its equivalent axiom systems. Indeed, matroids are amazingly versatile and the approaches to the subject are varied and numerous. This book is a primer in the basic axioms and constructions of matroids. The contributions by various leaders in the field include chapters on axiom systems, lattices, basis exchange properties, orthogonality, graphs and networks, constructions, maps, semi-modular functions and an appendix on cryptomorphisms. The authors have concentrated on giving a lucid exposition of the individual topics; explanations of theorems are preferred to complete proofs and original work is thoroughly referenced. In addition, exercises are included for each topic.

## Matroids: A Geometric Introduction

**Author**: Gary Gordon,Jennifer McNulty**Publisher:**Cambridge University Press**ISBN:**0521145686**Category:**Language Arts & Disciplines**Page:**393**View:**474

This friendly introduction helps undergraduate students understand and appreciate matroid theory and its connections to geometry.

## Graph Theory Applications

**Author**: L.R. Foulds**Publisher:**Springer Science & Business Media**ISBN:**9780387975993**Category:**Mathematics**Page:**408**View:**3088

The first part of this text covers the main graph theoretic topics: connectivity, trees, traversability, planarity, colouring, covering, matching, digraphs, networks, matrices of a graph, graph theoretic algorithms, and matroids. These concepts are then applied in the second part to problems in engineering, operations research, and science as well as to an interesting set of miscellaneous problems, thus illustrating their broad applicability. Every effort has been made to present applications that use not merely the notation and terminology of graph theory, but also its actual mathematical results. Some of the applications, such as in molecular evolution, facilities layout, and graffic network design, have never appeared before in book form. Written at an advanced undergraduate to beginning graduate level, this book is suitable for students of mathematics, engineering, operations research, computer science, and physical sciences as well as for researchers and practitioners with an interest in graph theoretic modelling.

## Matroid Applications

**Author**: Neil White**Publisher:**Cambridge University Press**ISBN:**9780521381659**Category:**Mathematics**Page:**363**View:**4519

This volume, the third in a sequence that began with The Theory of Matroids and Combinatorial Geometries, concentrates on the applications of matroid theory to a variety of topics from engineering (rigidity and scene analysis), combinatorics (graphs, lattices, codes and designs), topology and operations research (the greedy algorithm).

## Topics in Matroid Theory

**Author**: Leonidas S. Pitsoulis**Publisher:**Springer Science & Business Media**ISBN:**1461489571**Category:**Mathematics**Page:**127**View:**9679

Topics in Matroid Theory provides a brief introduction to matroid theory with an emphasis on algorithmic consequences.Matroid theory is at the heart of combinatorial optimization and has attracted various pioneers such as Edmonds, Tutte, Cunningham and Lawler among others. Matroid theory encompasses matrices, graphs and other combinatorial entities under a common, solid algebraic framework, thereby providing the analytical tools to solve related difficult algorithmic problems. The monograph contains a rigorous axiomatic definition of matroids along with other necessary concepts such as duality, minors, connectivity and representability as demonstrated in matrices, graphs and transversals. The author also presents a deep decomposition result in matroid theory that provides a structural characterization of graphic matroids, and show how this can be extended to signed-graphic matroids, as well as the immediate algorithmic consequences.

## Handbook of Incidence Geometry

*Buildings and Foundations*

**Author**: Francis Buekenhout**Publisher:**North-Holland**ISBN:**9780444883551**Category:**Mathematics**Page:**1420**View:**9331

This Handbook deals with the foundations of incidence geometry, in relationship with division rings, rings, algebras, lattices, groups, topology, graphs, logic and its autonomous development from various viewpoints. Projective and affine geometry are covered in various ways. Major classes of rank 2 geometries such as generalized polygons and partial geometries are surveyed extensively. More than half of the book is devoted to buildings at various levels of generality, including a detailed and original introduction to the subject, a broad study of characterizations in terms of points and lines, applications to algebraic groups, extensions to topological geometry, a survey of results on diagram geometries and nearby generalizations such as matroids.

## Combinatorial Geometries

**Author**: Neil White**Publisher:**Cambridge University Press**ISBN:**9780521333399**Category:**Mathematics**Page:**212**View:**9643

This book is a continuation of Theory of Matroids and again consists of a series of related surveys.