JCT
2008
14 years 24 days ago
2008
We argue that a Golay complementary sequence is naturally viewed as a projection of a multidimensional Golay array. We present a three-stage process for constructing and enumerati...
JCT
2008
14 years 24 days ago
2008
JCT
2008
14 years 24 days ago
2008
If a Steiner system S(4, 5, 17) exists, it would contain derived S(3, 4, 16) designs. By relying on a recent classification of the S(3, 4, 16), an exhaustive computer search for S...
JCT
2008
14 years 24 days ago
2008
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
JCT
2008
14 years 24 days ago
2008
JCT
2008
14 years 24 days ago
2008
A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one. In this note, we prove that if G is a graph such that for each edge xy E...
JCT
2008
14 years 24 days ago
2008
The Jones polynomial of an alternating link is a certain specialization of the Tutte polynomial of the (planar) checkerboard graph associated to an alternating projection of the li...
JCT
2008
14 years 24 days ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
JCT
2008
14 years 24 days ago
2008
JCT
2008
14 years 24 days ago
2008
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...