Factorisation of the complete graph into spanning regular factors
From MaRDI portal
Publication:6403159
DOI10.1016/J.AAM.2023.102487arXiv2206.12792MaRDI QIDQ6403159FDOQ6403159
Authors: Mahdieh Hasheminezhad, Brendan D. McKay 
Publication date: 26 June 2022
Abstract: We enumerate factorisations of the complete graph into spanning regular graphs in several cases, including when the degrees of all the factors except for one or two are small. The resulting asymptotic behaviour is seen to generalise the number of regular graphs in a simple way. This leads us to conjecture a general formula when the number of factors is vanishing compared to the number of vertices.
Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
This page was built for publication: Factorisation of the complete graph into spanning regular factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6403159)
