Group divisible pentagon systems

Authors

  • Billington, Elizabeth J.
  • Hoffman D.G.
  • Maenhaut, Barbara M.

Abstract

A group divisible pentagon system is a decomposition of the edge set of the λ-fold complete partite graph with m parts of size n into edge disjoint 5-cycles. In this paper it is shown that the obvious necessary conditions for such a decomposition are in fact sufficient.

Published

1999-05-09

How to Cite

Billington, Elizabeth J., Hoffman D.G., & Maenhaut, Barbara M. (1999). Group divisible pentagon systems. Utilitas Mathematica, 55. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/142

Issue

Vol. 55 (1999): Volume 55,1999

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.