A note on $m$-factorizations of complete multigraphs arising from designs
Gy\"orgy Kiss, Christian Rubio-Montiel

TL;DR
This paper introduces new infinite families of indecomposable m-factorizations of complete multigraphs, primarily derived from finite geometries, expanding the understanding of graph decompositions.
Contribution
It presents novel infinite families of indecomposable m-factorizations of complete multigraphs using finite geometry methods.
Findings
New infinite families of indecomposable m-factorizations
Most constructions originate from finite geometries
Advances understanding of graph decompositions
Abstract
Some new infinite families of simple, indecomposable -factorizations of the complete multigraph are presented. Most of the constructions come from finite geometries.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
