492 search results - page 24 / 99 » combinatorics 2006 |
COMBINATORICS
1999
15 years 5 months ago
1999
120
click to vote
COMBINATORICS
1999
15 years 5 months ago
1999
A rational matrix is totally dyadic if all of its nonzero subdeterminants are in {
136
click to vote
COMBINATORICS
2002
15 years 5 months ago
2002
If G = Kn is the complete graph, the classical Pr
110
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
We show that the linear discrepancy of a basic totally unimodular matrix A Rm