# Some Partitionings of Complete Designs

## TL;DR

This paper introduces a novel way to partition the set of all 3-element subsets of a v-set, where v is congruent to 2 modulo 4, using simple trades, contributing to combinatorial design theory.

## Contribution

It presents a new partitioning method of complete 3-uniform hypergraphs into simple trades for specific v values, advancing combinatorial design techniques.

## Key findings

- New partitioning scheme for 3-subsets
- Applicable for v ≡ 2 (mod 4)
- Enhances understanding of combinatorial trades

## Abstract

Let $v\geq6$ be an integer with $v\equiv2 \pmod 4$. In this paper, we introduce a new partitioning of the set of all $3$-subsets of a $v$-set into some simple trades.