Introduction to the theory of matroids
著者
書誌事項
Introduction to the theory of matroids
（Mathematical economics）（Lecture notes in economics and mathematical systems, 109）
Springer-Verlag, 1975
- : gw
- : us
大学図書館所蔵 件 / 全56件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
Matroid theory has its origin in a paper by H. Whitney entitled "On the abstract properties of linear dependence" [35], which appeared in 1935. The main objective of the paper was to establish the essential (abstract) properties of the concepts of linear dependence and independence in vector spaces, and to use these for the axiomatic definition of a new algebraic object, namely the matroid. Furthermore, Whitney showed that these axioms are also abstractions of certain graph-theoretic concepts. This is very much in evidence when one considers the basic concepts making up the structure of a matroid: some reflect their linear algebraic origin, while others reflect their graph-theoretic origin. Whitney also studied a number of important examples of matroids. The next major development was brought about in the forties by R. Rado's matroid generalisation of P. Hall's famous "marriage" theorem. This provided new impulses for transversal theory, in which matroids today play an essential role under the name of "independence structures", cf. the treatise on transversal theory by L. Mirsky [26J. At roughly the same time R.P. Dilworth estab lished the connection between matroids and lattice theory. Thus matroids became an essential part of combinatorial mathematics. About ten years later W.T. Tutte [30] developed the funda mentals of matroids in detail from a graph-theoretic point of view, and characterised graphic matroids as well as the larger class of those matroids that are representable over any field.
目次
I. Equivalent Axiomatic Definitions and Elementary Properties of Matroids.- 1.1. The first rank-axiomatic definition of a matroid.- 1.2. The independence-axiomatic definition of a matroid.- 1.3. The second rank-axiomatic definition of a matroid.- 1.4. The circuit-axiomatic definition of a matroid.- 1.5. The basis-axiomatic definition of a matroid.- II. Further Properties of Matroids.- 2.1. The span mapping.- 2.2. The span-axiomatic definition of a matroid.- 2.3. Hyperplanes and cocircuits.- 2.4. The dual matroid.- III. Examples.- 3.1. Linear algebraic examples.- 3.2. Binary matroids.- 3.3. Elementary definitions and results from graph theory.- 3.4. Graph-theoretic examples.- 3.5. Combinatorial examples.- IV. Matroids and the Greedy Algorithm.- 4.1. Matroids and the greedy algorithm.- V. Exchange Properties for Bases of Matroids.- 5.1. Symmetric point exchange.- 5.2. Bijective point replacement.- 5.3. More on minors of a matroid.- 5.4. Symmetric set exchange.- 5.5. Bijective set replacement.- 5.6. A further symmetric set exchange property.
「Nielsen BookData」 より