Graphic Matroid

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


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.

Subject classifications