The Ramsey number is known for only a few specific knots and links, namely the Hopf link and the trefoil knot (although not published in periodicals). We establish the lower bound of all Ramsey numbers of any knot to be one greater than its stick number. 1 Background and Definitions The study of Ramsey numbers of knots can be found at the intersection of knot theory and graph theory. 1.1 Knot Theory Background A knot is a simple closed curve in ℜ 3, while a link is a set of disjoint knots. As shown in figure 1 the unknot(a), trefoil knot(b), figure-8 knot(c), unlink(d), and Hopf link(e) are examples of inequivalent links. Figure 1- Some simple knots Stick knots are knots composed of straight line segments intersecting only two at a time. Th...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
AbstractA method to improve the lower bounds for Ramsey numbers R(k,l) is provided: one may construc...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
This paper gives new upper bounds on the stick numbers of the knots $9_{18}$, $10_{18}$, $10_{58}$, ...
The lattice stick number of a knot type is defined to be the minimal number of straight line segment...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
In diploma thesis we will describe concept of a knot invariant known as the stick number. This conce...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that fo...
The cube graph Qn is the skeleton of the n-dimensional cube. It is an n-regular graph on 2n vertices...
In this note an adaptation of heuristic tabu search algorithm for finding Ramsey graphs is presented...
AbstractWe present explicit constructions of three families of graphs that yield the following lower...
Abstract. The cubic lattice stick index of a knot type is the least number of sticks necessary to co...
Ramsey's Theorem is a cornerstone of combinatorics and logic. In its simplest formulation it says th...
We use algorithms in the software KnotPlot to compute upper bounds for the equilateral stick numbers...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
AbstractA method to improve the lower bounds for Ramsey numbers R(k,l) is provided: one may construc...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
This paper gives new upper bounds on the stick numbers of the knots $9_{18}$, $10_{18}$, $10_{58}$, ...
The lattice stick number of a knot type is defined to be the minimal number of straight line segment...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
In diploma thesis we will describe concept of a knot invariant known as the stick number. This conce...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that fo...
The cube graph Qn is the skeleton of the n-dimensional cube. It is an n-regular graph on 2n vertices...
In this note an adaptation of heuristic tabu search algorithm for finding Ramsey graphs is presented...
AbstractWe present explicit constructions of three families of graphs that yield the following lower...
Abstract. The cubic lattice stick index of a knot type is the least number of sticks necessary to co...
Ramsey's Theorem is a cornerstone of combinatorics and logic. In its simplest formulation it says th...
We use algorithms in the software KnotPlot to compute upper bounds for the equilateral stick numbers...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
AbstractA method to improve the lower bounds for Ramsey numbers R(k,l) is provided: one may construc...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...