COMBINATORICA
2008
13 years 10 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
COMBINATORICA
2008
13 years 10 months ago
2008
COMBINATORICA
2008
13 years 11 months ago
2008
COMBINATORICA
2008
13 years 11 months ago
2008
COMBINATORICA
2007
13 years 11 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
COMBINATORICA
2008
13 years 11 months ago
2008
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
COMBINATORICA
2008
13 years 11 months ago
2008
COMBINATORICA
2008
13 years 11 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
COMBINATORICA
2008
13 years 11 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
COMBINATORICA
2008
13 years 11 months ago
2008
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...