A note on $m$-factorizations of complete multigraphs arising from designs
Combinatorics
2018-09-28 v1
Abstract
Some new infinite families of simple, indecomposable -factorizations of the complete multigraph are presented. Most of the constructions come from finite geometries.
Keywords
Cite
@article{arxiv.1407.5480,
title = {A note on $m$-factorizations of complete multigraphs arising from designs},
author = {György Kiss and Christian Rubio-Montiel},
journal= {arXiv preprint arXiv:1407.5480},
year = {2018}
}