A note on the 1-factorization of non-uniform complete hypergraph

DOI10.1016/J.AMC.2024.129007MaRDI QIDQ6994216zbMATH OpenFDO

Authors Taijiang Jiang, Qiang Sun, Chao Zhang

Publication date 24 April 2025

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2024.129007

zbMATH Keywords

1-factorizationhypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A Census of Small Latin Hypercubes
• Connected Baranyai's theorem
• Extending factorizations of complete uniform hypergraphs
• scientific article; zbMATH DE number 3121292 (Why is no real title available?)
• scientific article; zbMATH DE number 3478938 (Why is no real title available?)
• scientific article; zbMATH DE number 3570501 (Why is no real title available?)
• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• On the Edge-Coloring Property for the Closure of the Complete Hypergraphs
• Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs
• Sets of orthogonal hypercubes of class \(r\)
• Symmetric Layer-Rainbow Colorations of Cubes
• The perfect matching and tight Hamilton cycle decomposition of complete n-balanced mk-partite k-uniform hypergraphs

Cited in

(1)

• Ore-type condition for Hamilton -cycle in k-uniform hypergraphs

This page was built for publication: A note on the 1-factorization of non-uniform complete hypergraph

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