AbstractUsing an earlier characterization of simplicial hypergraphs we obtain a characterization of binary simplicial matroids in terms of the existence of a special base
A special case of a theorem of Turán is that a graph on v vertices, with no loops, parallel edges, o...
AbstractA well-known result of Tutte is that U2,4, the 4-point line, is the only non-binary matroid ...
It is well known that a rank-r matroid M is uniquely determined by its circuits of size at most r. T...
AbstractUsing an earlier characterization of simplicial hypergraphs we obtain a characterization of ...
AbstractIn an earlier paper we defined a class of matroids whose circuit are combinatorial generaliz...
AbstractShort proofs are presented for two results due respectively to Tutte and Welsh
This note gives a characterization of binary geometries by means of a double elimination axiom which...
Let M be a simple matroid (= combinatorial geometry). On the bases of M we consider two matroids S(M...
AbstractLet (ks) denote the set of all k-element-subsets of a finite set S. A k-simplical matroid on...
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of clo...
AbstractAs is well known, the cycles of any given graph G may be regarded as the circuits of a matro...
The definition of simplicial matroids over the rationals, which was introduced by Crapo and Rota, ge...
AbstractThe concept of a circuit basis for a matroid is introduced, as an algorithmically rapid way ...
AbstractIt is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Mat...
AbstractIt is proved that, if M is a binary matroid, then every cocircuit of M has even cardinality ...
A special case of a theorem of Turán is that a graph on v vertices, with no loops, parallel edges, o...
AbstractA well-known result of Tutte is that U2,4, the 4-point line, is the only non-binary matroid ...
It is well known that a rank-r matroid M is uniquely determined by its circuits of size at most r. T...
AbstractUsing an earlier characterization of simplicial hypergraphs we obtain a characterization of ...
AbstractIn an earlier paper we defined a class of matroids whose circuit are combinatorial generaliz...
AbstractShort proofs are presented for two results due respectively to Tutte and Welsh
This note gives a characterization of binary geometries by means of a double elimination axiom which...
Let M be a simple matroid (= combinatorial geometry). On the bases of M we consider two matroids S(M...
AbstractLet (ks) denote the set of all k-element-subsets of a finite set S. A k-simplical matroid on...
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of clo...
AbstractAs is well known, the cycles of any given graph G may be regarded as the circuits of a matro...
The definition of simplicial matroids over the rationals, which was introduced by Crapo and Rota, ge...
AbstractThe concept of a circuit basis for a matroid is introduced, as an algorithmically rapid way ...
AbstractIt is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Mat...
AbstractIt is proved that, if M is a binary matroid, then every cocircuit of M has even cardinality ...
A special case of a theorem of Turán is that a graph on v vertices, with no loops, parallel edges, o...
AbstractA well-known result of Tutte is that U2,4, the 4-point line, is the only non-binary matroid ...
It is well known that a rank-r matroid M is uniquely determined by its circuits of size at most r. T...
DOI
Add to ORKG