pith. sign in

arxiv: 1503.00446 · v1 · pith:CEW5SRUTnew · submitted 2015-03-02 · 🧮 math.CO

Resolvable G-designs of order v and index {λ}

classification 🧮 math.CO
keywords indexlambdaorderproblemresolvablecasesconcerningconnected
0
0 comments X
read the original abstract

In this paper we consider the problem concerning the existence of a resolvable G-design of order v and index {\lambda}. We solve the problem for the cases in which G is a connected subgraph of K_4.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.