On matroids with many common bases

نویسندگان

چکیده

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

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

منابع مشابه

On Disjoint Common Bases in Two Matroids

We prove two results on packing common bases of two matroids. First, we show that the computational problem of common base packing reduces to the special case where one of the matroids is a partition matroid. Second, we give a counterexample to a conjecture of Chow, which proposed a sufficient condition for the existence of a common base packing. Chow’s conjecture is a generalization of Rota’s ...

متن کامل

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 ...

متن کامل

Bases in Infinite Matroids

We consider bases in matroids of infinite rank, and prove: (a) the existence of a perfect matching in the 'transition graph' of any two bases. This is an extension of the existence of a non-zero generalized diagonal in the transition matrix between bases in finite dimensional linear spaces, and settles a conjecture of the second author [8]. (b) A Cantor-Bernstein theorem for matroids. (c) The e...

متن کامل

Equicovering matroids by distinct bases

We ask, and answer, the following question: when is it possible to cover the elements of a given matroid M by p distinct bases so that each element is covered exactly k times? Our result is weaker than the Cyclic Order Conjecture of Wiedemann [9] (and of Kajitani, Ueno and Miyano [7]), but stronger than similar previous results; it could represent a first step towards resolving the conjecture.

متن کامل

Counting Bases of Representable Matroids

We show that it is #P-complete to count the number of bases of matroids representable over a fixed infinite field or fields of fixed characteristic.

متن کامل

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


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

ژورنال

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

سال: 1999

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(99)00005-9