Related papers: On fiber diameters of continuous maps

We solve a problem in the combinatorics of polyhedra motivated by the network simplex method. We show that the Hirsch conjecture holds for the diameter of the graphs of all network-flow polytopes, in particular the diameter of a…

A new type of Hopf invariant is described for the fiber of the pinch map from the mapping cone of a map from A to X onto to the suspension of A; this is then used to study the boundary map in the fibration sequence of Cohen, Moore and…

Let M be a hyperbolic 3-manifold with nonempty totally geodesic boundary. We prove that there are upper and lower bounds on the diameter of the skinning map of M that depend only on the volume of the hyperbolic structure with totally…

We show the existence of polynomial maps which have a regular bifurcation value, while over a neighbourhood of this value the fibres are connected and diffeomorphic.

Consider a graph $G$ drawn on a fixed surface, and assign to each vertex a list of colors of size at least two if $G$ is triangle-free and at least three otherwise. We prove that we can give each vertex a color from its list so that each…

A strong orientation of a graph $G$ is an assignment of a direction to each edge such that $G$ is strongly connected. The oriented diameter of $G$ is the smallest diameter among all strong orientations of $G$. A block of $G$ is a maximal…

It is proved that no region of a homogeneous locally compact, locally connected metric space can be cut by an $F_\sigma$-subset of a "smaller" dimension. The result applies to different finite or infinite topological dimensions of…

We study the mean-median map as a dynamical system on the space of finite sets of piecewise-affine continuous functions with rational coefficients. We determine the structure of the limit function in the neighbourhood of a distinctive…

We establish an upper bound on the spectral gap for compact quantum graphs which depends only on the diameter and total number of vertices. This bound is asymptotically sharp for pumpkin chains with number of edges tending to infinity.

We prove that the general fibre of the $i$-th Gauss map has dimension $m$ if and only if at the general point the $(i+1)$-th fundamental form consists of cones with vertex a fixed $\mathbb P^{m-1}$, extending a known theorem for the usual…

We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these…

When f : R power n to R power p, is a surjective real analytic map with isolated critical value, we prove that the (m)-regularity condition (in a sense we define) ensures that f ||f|| is a fibration on small spheres, f induces a fibration…

Let $M$ be a connected, non-compact $m$-dimensional Riemannian manifold. In this paper we consider smooth maps $\phi: M \to \mathbb{R}^n$ with images inside a non-degenerate cone. Under quite general assumptions on $M$, we provide a lower…

Every smooth fiber bundle admits a complete (Ehresmann) connection. This result appears in several references, with a proof on which we have found a gap, that does not seem possible to remedy. In this note we provide a definite proof for…

A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…

We observe that the diameter of small (in a locally uniform sense) balls in $C^{1,1}$ sub-Riemannian manifolds equals twice the radius. We also prove that, when the regularity of the structure is further lowered to $C^0$, the diameter is…

It is shown that a.a.s. as soon as a Kronecker graph becomes connected its diameter is bounded by a constant.

We prove that a minor-closed class of graphs has bounded layered pathwidth if and only if some apex-forest is not in the class. This generalises a theorem of Robertson and Seymour, which says that a minor-closed class of graphs has bounded…

The present paper considers Hofer's distance between diameters in the unit disk. We prove that this distance is unbounded and show its relation to Lagrangian intersections.

We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…