3 search results - page 1 / 1 » Mutation Polynomials and Oriented Matroids |
DCG
2000
13 years 5 months ago
2000
Several polynomials are of use in various enumeration problems concerning objects in oriented matroids. Chief among these is the Radon catalog. We continue to study these, as well ...
IPCO
2007
13 years 6 months ago
2007
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
GD
1994
Springer
13 years 9 months ago
1994
Springer
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank ...