Related papers: Upper Bounds for Ropelength as a Function of Cross…

It is shown that every $n$-vertex graph that admits a 2-bend RAC drawing in the plane, where the edges are polylines with two bends per edge and any pair of edges can only cross at a right angle, has at most $20n-24$ edges for $n\geq 3$.…

In this paper we introduce a new technique, based on dual quaternions, for the analysis of closed linkages with revolute joints: the theory of bonds. The bond structure comprises a lot of information on closed revolute chains with a…

For a graph G, its rth power G^r has the same vertex set as G, and has an edge between any two vertices within distance r of each other in G. We give a lower bound for the number of edges in the rth power of G in terms of the order of G and…

In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.

The number of topologically different plane real algebraic curves of a given degree $d$ has the form $\exp(C d^2 + o(d^2))$. We determine the best available upper bound for the constant $C$. This bound follows from Arnold inequalities on…

We extend techniques due to Pardon to show that there is a lower bound on the distortion of a knot in $\mathbb{R}^3$ proportional to the minimum of the bridge distance and the bridge number of the knot. We also exhibit an infinite family of…

We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…

We revisit here a fundamental result on planar triangulations, namely that the flip distance between two triangulations is upper-bounded by the number of proper intersections between their straight-segment edges. We provide a complete and…

First, we consider order-$n$ ribbon tilings of an $M$-by-$N$ rectangle $R_{M,N}$ where $M$ and $N$ are much larger than $n$. We prove the existence of the growth rate $\gamma_n$ of the number of tilings and show that $\gamma_n \leq (n-1)…

This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower…

Graphs with bounded treewidth and bounded maximum degree are known to have tree-partitions of bounded width. What can be said if the bounded treewidth assumption is strengthened to bounded pathwidth? We prove that every graph with bounded…

We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…

We prove that the Jones diameter of a link is twice its crossing number whenever the breadth of its Jones polynomial equals the difference between the crossing number and the Turaev genus. This implies that such link is adequate, as per the…

We investigate the bounds on algebraic connectivity of graphs subject to constraints on the number of edges, vertices, and topology. We show that the algebraic connectivity for any tree on $n$ vertices and with maximum degree $d$ is bounded…

Let $G$ be a graph, $C$ a longest cycle in $G$ and $\overline{p}$, $\overline{c}$ the lengths of a longest path and a longest cycle in $G\backslash C$, respectively. Almost all lower bounds for the circumference base on a standard…

Alternative proof is given for an earlier presented result that if a link in 3-space bounds a compact oriented proper surface (without closed component) in the upper half 4-space, then the link bounds a ribbon surface in the upper half…

In this paper, we show a new upper bound of prime gaps, that is the gap between a prime number and its consecutive prime number. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…

We prove analogs of Brooks' Theorem for the list-distinguishing chromatic number of different classes of simple finite connected graphs. Moreover, we determine two upper bounds for the list-distinguishing chromatic number of a graph G in…

The lattice stick number $s_L(L)$ of a link $L$ is defined to be the minimal number of straight line segments required to construct a stick presentation of $L$ in the cubic lattice. Hong, No and Oh found a general upper bound $s_L(K) \leq 3…

The ropelength of a knot or link is the minimal number of inches of 1-inch-thick rope that it takes to tie it. The relationship of this measurement to knot and link invariants has been studied by various authors. We give the first results…