Abstractℓ-matrices are defined and shown to be the incidence matrices of certain matroids (lines). The well-known characterizations of binary matroids of W.T. Tutte and A. Lehman are proved along with a new characterization. The proofs use ℓ-matrices
A well-known result of Tutte is that U2,4, the 4-point line, is the only non-binary matroid M such t...
The incidence matrix of a graph is a fundamental object naturally appearing in many applications, in...
A result of Seymour implies that any 3-connected matroid with a modular 3-point line is binary. We p...
AbstractShort proofs are presented for two results due respectively to Tutte and Welsh
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s...
AbstractLet P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is...
Short proofs are presented for two results due respectively to Tutte and Welsh. © 1981.SCOPUS: ar.ji...
If G is a looped graph, then its adjacency matrix represents a binary matroid MA(G) on V (G). MA(G) ...
AbstractA bicircular matroid is a matroid defined on the edge set of a graph. Two different graphs c...
AbstractA well-known result of Tutte is that U2,4, the 4-point line, is the only non-binary matroid ...
A theorem concerning matroids is proved which—specialized to representable matroids—implies that giv...
Abstracte present a number of combinatorial characterizations of K-matrices. This extends a theorem ...
We give, in terms of totally unimodular matrices, a short and easy proof of Tutte's characterization...
AbstractWe introduce a new class of binary matroids called almost regular. Any such matroid is not r...
não disponívelOur objective in this work is to study the problem of converting a given matrix to an ...
A well-known result of Tutte is that U2,4, the 4-point line, is the only non-binary matroid M such t...
The incidence matrix of a graph is a fundamental object naturally appearing in many applications, in...
A result of Seymour implies that any 3-connected matroid with a modular 3-point line is binary. We p...
AbstractShort proofs are presented for two results due respectively to Tutte and Welsh
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s...
AbstractLet P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is...
Short proofs are presented for two results due respectively to Tutte and Welsh. © 1981.SCOPUS: ar.ji...
If G is a looped graph, then its adjacency matrix represents a binary matroid MA(G) on V (G). MA(G) ...
AbstractA bicircular matroid is a matroid defined on the edge set of a graph. Two different graphs c...
AbstractA well-known result of Tutte is that U2,4, the 4-point line, is the only non-binary matroid ...
A theorem concerning matroids is proved which—specialized to representable matroids—implies that giv...
Abstracte present a number of combinatorial characterizations of K-matrices. This extends a theorem ...
We give, in terms of totally unimodular matrices, a short and easy proof of Tutte's characterization...
AbstractWe introduce a new class of binary matroids called almost regular. Any such matroid is not r...
não disponívelOur objective in this work is to study the problem of converting a given matrix to an ...
A well-known result of Tutte is that U2,4, the 4-point line, is the only non-binary matroid M such t...
The incidence matrix of a graph is a fundamental object naturally appearing in many applications, in...
A result of Seymour implies that any 3-connected matroid with a modular 3-point line is binary. We p...
DOI
Add to ORKG