AbstractIn 1957, W.M. Hirsch conjectured that every (convex) d-polytope with n facets has edge-diameter at most n−d. Recently, Holt and Klee constructed polytopes which meet this bound for a number of pairs (d,n) with d⩽13 and for all pairs (d,n) with d⩾14. These constructions involve a judicious use of truncation, wedging, and blending on polytopes which already meet the Hirsch bound. In this paper we extend these techniques to construct polytopes of edge-diameter n−d for all (d,n) with d⩾8. The improvement from d=14 to d=8 follows from identifying circumstances in which the results for wedging when n>2d can be extended to the cases n⩽2d
ABSTRACT. Warren M. Hirsch posed the conjecture which bears his name in a letter of 1957 to George B...
AbstractThirty years ago the connection was established between the presence of nonrevisiting paths ...
AbstractBlending two simple polytopes together at vertices, at edges, or at other supplementary face...
In 1957 W.M. Hirsch conjectured that every d-polytope with n facets has edge-diameter at most n \Gam...
AbstractIn 1957, W.M. Hirsch conjectured that every (convex) d-polytope with n facets has edge-diame...
Let ∆(d, n) be the maximum possible edge diameter over all d-dimensional polytopes defined by n ineq...
The Hirsch conjecture was posed in 1957 in a question from Warren M. Hirsch to George Dantzig. It st...
Abstract. The still open Hirsch conjecture asserts that where (d, n) denotes the maximum edge-diamet...
Abstract The Hirsch Conjecture (1957) stated that the graph of a d-dimensional polytope with n face...
The Hirsch Conjecture (1957) stated that the graph of a d-dimensional polytope with n facets cannot ...
International audienceThe purpose of this paper is the formal verification of a counterexample of Sa...
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the gr...
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the gr...
AbstractBlending two simple polytopes together at vertices, at edges, or at other supplementary face...
Warren M. Hirsch posed the conjecture which bears his name in a letter of 1957 to George B. Dantzig....
ABSTRACT. Warren M. Hirsch posed the conjecture which bears his name in a letter of 1957 to George B...
AbstractThirty years ago the connection was established between the presence of nonrevisiting paths ...
AbstractBlending two simple polytopes together at vertices, at edges, or at other supplementary face...
In 1957 W.M. Hirsch conjectured that every d-polytope with n facets has edge-diameter at most n \Gam...
AbstractIn 1957, W.M. Hirsch conjectured that every (convex) d-polytope with n facets has edge-diame...
Let ∆(d, n) be the maximum possible edge diameter over all d-dimensional polytopes defined by n ineq...
The Hirsch conjecture was posed in 1957 in a question from Warren M. Hirsch to George Dantzig. It st...
Abstract. The still open Hirsch conjecture asserts that where (d, n) denotes the maximum edge-diamet...
Abstract The Hirsch Conjecture (1957) stated that the graph of a d-dimensional polytope with n face...
The Hirsch Conjecture (1957) stated that the graph of a d-dimensional polytope with n facets cannot ...
International audienceThe purpose of this paper is the formal verification of a counterexample of Sa...
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the gr...
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the gr...
AbstractBlending two simple polytopes together at vertices, at edges, or at other supplementary face...
Warren M. Hirsch posed the conjecture which bears his name in a letter of 1957 to George B. Dantzig....
ABSTRACT. Warren M. Hirsch posed the conjecture which bears his name in a letter of 1957 to George B...
AbstractThirty years ago the connection was established between the presence of nonrevisiting paths ...
AbstractBlending two simple polytopes together at vertices, at edges, or at other supplementary face...