Graphic Matroid (original) (raw)

Algebra Applied Mathematics Calculus and Analysis Discrete Mathematics Foundations of Mathematics Geometry History and Terminology Number Theory Probability and Statistics Recreational Mathematics Topology

Alphabetical Index New in MathWorld


Suppose that G is a pseudograph, E is the edge set of G, and C is the family of edge sets of graph cycles of G. Then C obeys the axioms for the circuits of a matroid, and hence(E,C) is a matroid. Any matroid that can be obtained in this way is a graphic matroid.


See also

Matroid, Pseudograph

This entry contributed by Dillon Mayhew

Explore with Wolfram|Alpha

References

Oxley, J. G. Matroid Theory. Oxford, England: Oxford University Press, p. 11, 1991.

Referenced on Wolfram|Alpha

Graphic Matroid

Cite this as:

Mayhew, Dillon. "Graphic Matroid." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/GraphicMatroid.html

Subject classifications