Skip to main content
  • Book
  • © 2014

Topics in Matroid Theory

  • 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

Part of the book series: SpringerBriefs in Optimization (BRIEFSOPTI)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (6 chapters)

  1. Front Matter

    Pages i-xiv
  2. Introduction

    • Leonidas Pitsoulis
    Pages 1-4
  3. Graph Theory, Vector Spaces, and Transversals

    • Leonidas Pitsoulis
    Pages 5-24
  4. Definition of Matroids

    • Leonidas Pitsoulis
    Pages 25-45
  5. Decomposition of Graphic Matroids

    • Leonidas Pitsoulis
    Pages 75-100
  6. Signed-Graphic Matroids

    • Leonidas Pitsoulis
    Pages 101-120
  7. Back Matter

    Pages 121-127

About this book

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.  

Reviews

“The clear and concise style and the well chosen examples illustrating concepts, theorems and algorithms make this book a valuable resource for graduate students and researchers interested in theoretical and algorithmic applications of matroid theory.” (Brigitte Servatius, zbMATH 1319.05033, 2015)

“The goal of the book is to introduce a decomposition theorem providing a characterization of graphic and signed-graphic matroids. … The monograph is recommended basically to master or PhD students. … The book has a very logical structure which helps the reader to understand the whole issue.” (Bálint Márk Vásárhelyi, Acta Scientiarum Mathematicarum, Vol. 80 (3-4), 2014)

Authors and Affiliations

  • Dept. of Mathematical & Physical Sci., Aristotle University of Thessaloniki School of Engineering, Thessaloniki, Greece

    Leonidas S. Pitsoulis

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access