Symmetric factorisations of complete graphs

DOI10.3934/MFC.2023046MaRDI QIDQ7015244zbMATH OpenFDO

Authors Hua Han

Publication date 10 March 2025

Published in Mathematical Foundations of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/MFC.2023046

zbMATH Keywords

1-factorisation2-homogeneous permutation groupcomplete graphfeasible triplesymmetric factorisation

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Cites work

• k-homogeneous groups
• Common circulant homogeneous factorisations of the complete digraph
• Constructing homogeneous factorisations of complete graphs and digraphs
• Edge-transitive homogeneous factorizations of complete uniform hypergraphs
• Homogeneous factorisations of complete graphs with edge-transitive factors
• Homogeneous factorisations of complete multipartite graphs
• Homogeneous factorisations of graph products
• Homogeneous factorisations of graphs and digraphs
• Homogeneous factorisations of Johnson graphs
• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 46357 (Why is no real title available?)
• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• On partitioning the orbitals of a transitive permutation group
• Subgroups of prime power index in a simple group
• The Primitive Permutation Groups of Odd Degree

This page was built for publication: Symmetric factorisations of complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7015244)