An efficient algorithm is described for testing regularity of a matroid (i.e., representability over every field). Furthermore it is shown that a number of other matroid representability questions cannot be decided efficiently. In each case it is assumed that the matroid in question is specified by an independence oracle
In the matroid secretary problem we are given a stream of elements in random order and asked to choo...
AbstractThis paper surveys recent work in matroid representation theory and discusses a number of op...
Matroid theory is the study of abstract properties of linear dependence. A matroid consists of a fin...
An efficient algorithm is described for testing regularity of a matroid (i.e., representability over...
In this paper we look at complexity aspects of the following problem (matroid representability) whic...
Abstract. It is proved that, for a prime number p, showing that an n-element matroid is not represen...
Every biuniform matroid is representable over all sufficiently large fields. But it is not known exa...
Every biuniform matroid is representable over all sufficiently large fields. But it is not known exa...
This article is concerned with two notions of generalized matroid representations motivated by infor...
Let M = (E, I) be a matroid and let S = {S1,..., St} be a family of subsets of E of size p. A subfam...
AbstractTutte proved that a matroid is binary if and only if it does not contain a U2,4-minor. This ...
We investigate an approach to matroid complexity that involves describing a matroid via a list of in...
Let M = (E, I) be a matroid and let S = {S1,..., St} be a family of subsets of E of size p. A subfam...
En este trabajo presentamos un estudio de algunos de los aspectos más importantes de la teoría de ma...
Abstract. We show that, for every finite field, the class of all representable matroids of branch-wi...
In the matroid secretary problem we are given a stream of elements in random order and asked to choo...
AbstractThis paper surveys recent work in matroid representation theory and discusses a number of op...
Matroid theory is the study of abstract properties of linear dependence. A matroid consists of a fin...
An efficient algorithm is described for testing regularity of a matroid (i.e., representability over...
In this paper we look at complexity aspects of the following problem (matroid representability) whic...
Abstract. It is proved that, for a prime number p, showing that an n-element matroid is not represen...
Every biuniform matroid is representable over all sufficiently large fields. But it is not known exa...
Every biuniform matroid is representable over all sufficiently large fields. But it is not known exa...
This article is concerned with two notions of generalized matroid representations motivated by infor...
Let M = (E, I) be a matroid and let S = {S1,..., St} be a family of subsets of E of size p. A subfam...
AbstractTutte proved that a matroid is binary if and only if it does not contain a U2,4-minor. This ...
We investigate an approach to matroid complexity that involves describing a matroid via a list of in...
Let M = (E, I) be a matroid and let S = {S1,..., St} be a family of subsets of E of size p. A subfam...
En este trabajo presentamos un estudio de algunos de los aspectos más importantes de la teoría de ma...
Abstract. We show that, for every finite field, the class of all representable matroids of branch-wi...
In the matroid secretary problem we are given a stream of elements in random order and asked to choo...
AbstractThis paper surveys recent work in matroid representation theory and discusses a number of op...
Matroid theory is the study of abstract properties of linear dependence. A matroid consists of a fin...
DOI
Add to ORKG