The partition of a uniform hypergraph into pairs of dependent hyperedges

DOI10.1016/0012-365X(95)00322-NzbMath0869.05044MaRDI QIDQ1356565

Jenő Lehel

Publication date: 31 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

partitiondependency graphuniform hypergraphsmatching theoremdependent hyperedges

Mathematics Subject Classification ID

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

Cites Work

• Matching theory
• 1-Factors and Antifactor Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The partition of a uniform hypergraph into pairs of dependent hyperedges