Almost balanced biased graph representations of frame matroids

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost-Graphic Matroids

A nongraphic matroid M is said to be almost-graphic if, for all elements e, either M\e or M/e is graphic. We determine completely the class of almost-graphic matroids, thereby answering a question posed by Oxley in his book “Matroid Theory.” A nonregular matroid is said to be almost-regular if, for all elements e, either M\e or M/e is regular. An element e for which both M\e and M/e are regular...

متن کامل

Connectivity in frame matroids

We discuss the relationship between the vertical connectivity of a biased graph Ω and the Tutte connectivity of the frame matroid of Ω (also known as the bias matroid of Ω).

متن کامل

Representations of bicircular matroids

Coullard, C.R., J.G. de1 Greco and D.K. Wagner, Representations of bicircular matroids, Discrete Applied Mathematics 32 (1991) 223-240. A bicircular matroid is a matroid defined on the edge set of a graph. Two different graphs can have the same bicircular matroid. The first result of this paper is a characterization of the collection of graphs having the same bicircular matroid as a given arbit...

متن کامل

Topological Representations of Matroids

One of the foundations of oriented matroid theory is the topological representation theorem of Folkman and Lawrence [8]. It says that an oriented (simple) matroid can be realized uniquely as an arrangement of pseudospheres. That there is no similar interpretation for the class of all matroids has been taken for granted. For instance, “A non-coordinatizable matroid of abstract origin may be thou...

متن کامل

Two Remarks Concerning Balanced Matroids

The property of balance (in the sense of Feder and Mihail) is investigated in the context of paving matroids. The following examples are exhibited: (a) a class of “sparse” paving matroids that are balanced, but at the same time rich enough combinatorially to permit the encoding of hard counting problems; and (b) a paving matroid that is not balanced. The computational significance of (a) is the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2018

ISSN: 0196-8858

DOI: 10.1016/j.aam.2017.12.003