446 search results - page 2 / 90 » A Combinatorial Theorem for Trees |
COMBINATORICS
2004
13 years 5 months ago
2004
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
4OR
2010
13 years 5 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
DM
2006
13 years 5 months ago
2006
A general theorem for providing a class of combinatorial identities where the sum is over all the partitions of a positive integer is proven. Five examples as the applications of ...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
DCG
2002
13 years 5 months ago
2002
In this paper we study the topology of transversals to a family of convex sets as a subset of a Grassmanian manifold. This topology seems to be ruled by a combinatorial structure w...