Every matroid is a submatroid of a uniformly dense matroid

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

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

What Is a Matroid?

Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of dependence. Whitney’s definition embraces a surprising diversity of combinatorial structures. Moreover, matroids arise naturally in combinatorial optimization since they are precisely the structures for which the greedy algorithm works. This survey paper introduces matroid theory, presents some of the main t...

متن کامل

"What Is a Complex Matroid?"

Following an ‘Ansatz’ of Björner & Ziegler [BZ], we give an axiomatic development of finite sign vector systems that we call complex matroids. This includes, as special cases, the sign vector systems that encode complex arrangements according to [BZ], and the complexified oriented matroids, whose complements were considered by Gel’fand & Rybnikov [GeR]. Our framework makes it possible to study ...

متن کامل

Every non-Euclidean oriented matroid admits a biquadratic final polynomial

Richter-Gebert proved that every non-Euclidean uniform oriented matroid admits a biquadratic final polynomial. We extend this result to the non-uniform case.

متن کامل

Is each Mader matroid a gammoid?

A Mader matroid is obtained as follows. Let G = (V,E) be an undirected graph and let S1, . . . , Sk be disjoint subsets of V . Define S := S1 ∪ · · · ∪ Sk. Let I be the collection of all subsets I of S with the property that there exist disjoint paths P1, . . . , Pt such that each Pj has its ends in different sets Si and has no internal vertices in S and such that I is a subset of the set of en...

متن کامل

Covering matroid

In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions, coverings are more natural combinatorial objects and can sometimes be more efficient to deal with problems in the real world. Through extending partitions to cover...

متن کامل

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


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

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1995

ISSN: 0166-218X

DOI: 10.1016/0166-218x(94)00029-d