Characterizing graphic matroids by a system of linear equations
نویسندگان
چکیده
Given a rank-r binary matroid we construct a system of O(r) linear equations in O(r) variables that has a solution over GF(2) if and only if the matroid is graphic.
منابع مشابه
Base exchange properties of graphic matroids
New base exchange properties of binary and graphic matroids are derived. The graphic matroids within the class of 4-connected binary matroids are characterized by base exchange properties. Some progress with the characterization of arbitrary graphic matroids is made. Characterizing various types of matroids by base exchange properties is e.g. important in invariant theory.
متن کاملOn the decomposition of ternary matroids
Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of dependence. Matroids generalize linear dependence over vector spaces, and they also abstract the properties of graphs, in the former case they are called Vector Matroids, in the latter they are called Graphic Matroids [3]. The operation of Matroid Union was introduced by Nash-Williams in 1966. A matroid is i...
متن کاملStructural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملWeak orientability of matroids and polynomial equations
This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over F2, originally alluded to by Bland and Jensen in their seminal paper on weak orientability. The Bland-Jensen linear equations for a matroid M have a solution if and only if M is weakly orientable. We use the Bland-Jensen system to determin...
متن کاملQuasi-graphic matroids
Frame matroids and lifted-graphic matroids are two interesting generalizations of graphic matroids. Here we introduce a new generalization, quasi-graphic matroids, that unifies these two existing classes. Unlike frame matroids and lifted-graphic matroids, it is easy to certify that a matroid is quasi-graphic. The main result of the paper is that every 3-connected representable quasi-graphic mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 103 شماره
صفحات -
تاریخ انتشار 2013