18 search results - page 3 / 4 » combinatorica 2006 |
COMBINATORICA
2006
13 years 5 months ago
2006
We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m
COMBINATORICA
2006
13 years 5 months ago
2006
Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for ...
COMBINATORICA
2006
13 years 5 months ago
2006
ended abstract of this paper was presented at the 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), Springer-Verlag, LNCS 2285, pages 262
COMBINATORICA
2006
13 years 5 months ago
2006
We prove that the out-distance sequence {f+ (k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+ (k + 1) f+ (k)2 for k 1, where f+ (k) denotes the numbe...
COMBINATORICA
2006
13 years 5 months ago
2006
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...