Factorisation of the complete graph into spanning regular factors

DOI10.1016/j.aam.2023.102487OpenAlexW4318953876MaRDI QIDQ2689165

Mahdieh Hasheminezhad, Brendan D. McKay

Publication date: 9 March 2023

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.12792

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Asymptotic enumeration by degree sequence of graphs of high degree
• Subgraphs of Dense Random Graphs with Specified Degrees
• Asymptotic Enumeration ofk-Edge-Coloredk-Regular Graphs
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• Complex martingales and asymptotic enumeration
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂

This page was built for publication: Factorisation of the complete graph into spanning regular factors