547 search results - page 71 / 110 » dm 2008 |
84
Voted
DM
2000
15 years 18 days ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
77
Voted
DM
2002
15 years 18 days ago
2002
This paper is a continuation of Equimodular curves, LSE-CDAM-2000-17. First, it is shown by algebraic means that the equimodular curves for a reducible matrix are closed curves. T...
91
Voted
DM
2002
15 years 18 days ago
2002
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
105
Voted
DM
2002
15 years 18 days ago
2002
Balanced nested designs are closely related to other combinatorial structures such as balanced arrays and balanced n-ary designs. In particular, the existence of symmetric balance...
DM
2002
15 years 18 days ago
2002
We outline the computation of an explicit formula for the Hilbert function of the ladder determinantal varieties defined by the vanishing of all minors of a fixed size of a rectang...