Symmetric factorizations of the complete uniform hypergraph

DOI10.1007/s10801-017-0760-8zbMath1371.05199OpenAlexW2610555094WikidataQ114226152 ScholiaQ114226152MaRDI QIDQ2408114

Zai Ping Lu, Hu Ye Chen

Publication date: 9 October 2017

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-017-0760-8

zbMATH Keywords

uniform hypergraphMathieu groupSteiner system1-factorizationsymmetric factorizationfractional linear mapping\(k\)-homogeneous permutation group

Mathematics Subject Classification ID

Hypergraphs (05C65) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Subgroups of symmetric groups (20B35) Group actions on combinatorial structures (05E18)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homogeneous factorisations of complete graphs with edge-transitive factors
• A classification of the maximal subgroups of the finite alternating and symmetric groups
• On classifying finite edge colored graphs with two transitive automorphism groups.
• \(3\)-designs from PGL\((2,q)\)
• The Finite Simple Groups
• One-Factorizations of Complete Graphs with a Doubly Transitive Automorphism Group
• On partitioning the orbitals of a transitive permutation group
• Endliche Gruppen I

This page was built for publication: Symmetric factorizations of the complete uniform hypergraph