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.

Provides a sollid introduction to matroid theory Present results in matroid theory as they appear in the context of combinatorial optimization? Contains a strong emphasis on algorithmic consequences of matroid theory

Inhalt
1.Introduction.- 2.Graph Theory, Vector Spaces and Transversals.- 3.Definition of Matroids.- 4.Representability, Duality, Minors, and Connectivity.- 5. Decomposition of Graphic Matroids.- 6.Signed-Graphic Matroids.- List of Symbols.- Index.