55,752 research outputs found
Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture
We introduce a new combinatorial abstraction for the graphs of polyhedra. The
new abstraction is a flexible framework defined by combinatorial properties,
with each collection of properties taken providing a variant for studying the
diameters of polyhedral graphs. One particular variant has a diameter which
satisfies the best known upper bound on the diameters of polyhedra. Another
variant has superlinear asymptotic diameter, and together with some
combinatorial operations, gives a concrete approach for disproving the Linear
Hirsch Conjecture.Comment: 16 pages, 4 figure
Graphs of Transportation Polytopes
This paper discusses properties of the graphs of 2-way and 3-way
transportation polytopes, in particular, their possible numbers of vertices and
their diameters. Our main results include a quadratic bound on the diameter of
axial 3-way transportation polytopes and a catalogue of non-degenerate
transportation polytopes of small sizes. The catalogue disproves five
conjectures about these polyhedra stated in the monograph by Yemelichev et al.
(1984). It also allowed us to discover some new results. For example, we prove
that the number of vertices of an transportation polytope is a
multiple of the greatest common divisor of and .Comment: 29 pages, 7 figures. Final version. Improvements to the exposition of
several lemmas and the upper bound in Theorem 1.1 is improved by a factor of
tw
Transience and recurrence of random walks on percolation clusters in an ultrametric space
We study existence of percolation in the hierarchical group of order ,
which is an ultrametric space, and transience and recurrence of random walks on
the percolation clusters. The connection probability on the hierarchical group
for two points separated by distance is of the form , with , non-negative constants , and . Percolation was proved in Dawson and Gorostiza
(2013) for , with
. In this paper we improve the result for the critical case by
showing percolation for . We use a renormalization method of the type
in the previous paper in a new way which is more intrinsic to the model. The
proof involves ultrametric random graphs (described in the Introduction). The
results for simple (nearest neighbour) random walks on the percolation clusters
are: in the case the walk is transient, and in the critical case
, there exists a critical
such that the walk is recurrent for and transient for
. The proofs involve graph diameters, path lengths, and
electric circuit theory. Some comparisons are made with behaviours of random
walks on long-range percolation clusters in the one-dimensional Euclidean
lattice.Comment: 27 page
On the multiple Borsuk numbers of sets
The Borsuk number of a set S of diameter d >0 in Euclidean n-space is the
smallest value of m such that S can be partitioned into m sets of diameters
less than d. Our aim is to generalize this notion in the following way: The
k-fold Borsuk number of such a set S is the smallest value of m such that there
is a k-fold cover of S with m sets of diameters less than d. In this paper we
characterize the k-fold Borsuk numbers of sets in the Euclidean plane, give
bounds for those of centrally symmetric sets, smooth bodies and convex bodies
of constant width, and examine them for finite point sets in the Euclidean
3-space.Comment: 16 pages, 3 figure
Large circulant graphs of fixed diameter and arbitrary degree
We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attempts to generate families of large circulant graphs of arbitrary degree for a given diameter have concentrated mainly on the diameter 2 case. We present a direct product construction yielding improved bounds for small diameters and introduce a new general technique for âstitchingâ together circulant graphs which enables us to improve the current best known asymptotic orders for every diameter. As an application, we use our constructions in the directed case to obtain upper bounds on the minimum size of a subset A of a cyclic group of order n such that the k-fold sumset kA is equal to the whole group. We also present a revised table of largest known circulant graphs of small degree and diameter
Diameters, distortion and eigenvalues
We study the relation between the diameter, the first positive eigenvalue of
the discrete -Laplacian and the -distortion of a finite graph. We
prove an inequality relating these three quantities and apply it to families of
Cayley and Schreier graphs. We also show that the -distortion of Pascal
graphs, approximating the Sierpinski gasket, is bounded, which allows to obtain
estimates for the convergence to zero of the spectral gap as an application of
the main result.Comment: Final version, to appear in the European Journal of Combinatoric
- âŠ