In this paper we find the maximum number of pairwise edge-disjoint mcycles which exist in a complete graph with n vertices, for all values of n and m with 3 â‰¤ m â‰¤ n.

The system has the nice property that any pair of distinct elements of V occurs in exactly one of the subsets. This makes it an example of a Steiner triple system. Steiner triple systems firstâ€¦ (More)

Deterministic construction of measurement matrices for compressive sensing can be effected by first constructing a relatively small matrix explicitly, and then inflating it using a column replacementâ€¦ (More)

Given v, t , and m, does there exist a partial Steiner triple system of order v with t triples whose triples can be ordered so that any m consecutive triples are pairwise disjoint? Given v, t , andâ€¦ (More)