The existence of non-trivial hyperfactorizations of \(K_{2n}\)

DOI10.1007/BF01375468zbMath0760.05070WikidataQ59561064 ScholiaQ59561064MaRDI QIDQ1180405

Endre Boros, Dieter Jungnickel, Scott A. Vanstone

Publication date: 27 June 1992

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

complete graphhyperfactorization

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (1)

Guest editorial: Special issue in honor of Scott A. Vanstone

Cites Work

• On the existence of an infinite family of simple 5-designs
• Polynomial spaces
• One-factorizations of the complete graph—A survey
• The nonexistence of ovals in a projective plane of order 10
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The existence of non-trivial hyperfactorizations of \(K_{2n}\)