Dominating circuits in regular matroids

نویسندگان

چکیده

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

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

منابع مشابه

Dominating Circuits in Regular Matroids

In 1971, Nash-Williams proved that if G is a simple 2-connected graph on n vertices having minimum degree at least 3 (n+ 2), then any longest cycle C in G is also edge-domininating; that is, each edge of G has at least one end-vertex incident with a vertex of C. We say that a circuit C in a matroid M is dominating if each component of M/C has rank at most one. In this paper, we show that an ana...

متن کامل

Spanning Circuits in Regular Matroids

We consider the fundamental Matroid Theory problem of finding a circuit in a matroid spanning a set T of given terminal elements. For graphic matroids this corresponds to the problem of finding a simple cycle passing through a set of given terminal edges in a graph. The algorithmic study of the problem on regular matroids, a superclass of graphic matroids, was initiated by Gavenčiak, Král’, and...

متن کامل

Regular matroids without disjoint circuits

A cosimple regular matroid M does not have disjoint circuits if and only ifM ∈ {M(K3,3),M(Kn) (n ≥ 3)}. This extends a former result of Erdös and Pósa on graphs without disjoint circuits.

متن کامل

BASES AND CIRCUITS OF FUZZIFYING MATROIDS

In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...

متن کامل

Packing circuits in matroids

The purpose of this paper is to characterize all matroids M that satisfy the following minimax relation: For any nonnegative integral weight function w defined on E(M), Maximum {k : M has k circuits (repetition allowed) such that each element e of M is used at most 2w(e) times by these circuits} = Minimum {x∈X w(x) : X is a collection of elements (repetition allowed) of M such that every circui...

متن کامل

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


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

ژورنال

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

سال: 2014

ISSN: 0196-8858

DOI: 10.1016/j.aam.2013.10.001