Local equivalence of transversals in matroids

نویسندگان

چکیده

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

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

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

منابع مشابه

Local equivalence of transversals in matroids

Given any system of n subsets in a matroid M , a transversal of this system is an n-tuple of elements of M , one from each set, which is independent. Two transversals differing by exactly one element are adjacent, and two transversals connected by a sequence of adjacencies are locally equivalent, the distance between them being the minimum number of adjacencies in such a sequence. We give two s...

متن کامل

Definable Transversals of Analytic Equivalence Relations

We examine the circumstances under which certain analytic equivalence relations on Polish spaces have definable transversals.

متن کامل

An equivalence functor between local vector lattices and vector lattices

We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...

متن کامل

A Note on Maxflow-Mincut and Homomorphic Equivalence in Matroids

Graph homomorphisms are used to study good characterizations for coloring problems (Trans. Amer. Math. Soc. 384 (1996), 1281–1297; Discrete Math. 22 (1978), 287–300). Particularly, the following concept arises in this context: A pair of graphs (A, B) is called a homomorphism duality if for any graph G either there exists a homomorphism σ : A→ G or there exists a homomorphism τ : G → B but not b...

متن کامل

Unlabeled equivalence for matroids representable over finite fields

Two r × n matrices A and A′ representing the same matroid M over GF (q), where q is a prime power, are projective equivalent representations of M if one can be obtained from the other by elementary row operations and column scaling. Bounds for projective inequivalence are difficult to obtain and are known for only a few special classes of matroids. In this paper we define two matrices A and A′ ...

متن کامل

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


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

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 1996

ISSN: 1077-8926

DOI: 10.37236/1248