Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions

DOI10.1016/0012-365X(91)90006-NzbMath0739.05004OpenAlexW4234718395WikidataQ122952339 ScholiaQ122952339MaRDI QIDQ1176724

Hans-Dietrich O. F. Gronau, Bernhard Ganter

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90006-n

zbMATH Keywords

partitionsMTSMendelsohn Triple Systems

Mathematics Subject Classification ID

Partitions of sets (05A18)

Related Items (11)

New type of coding problem motivated by database theory ⋮ The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique ⋮ A survey of some combinatorial results concerning functional dependencies in database relations. ⋮ On a problem of Hering concerning orthogonal covers of \({\mathbf K}_ n\) ⋮ Orthogonal double covers of complete graphs by trees ⋮ Minimum matrix representation of Sperner systems ⋮ General symmetric starter of orthogonal double covers of complete bipartite graph ⋮ Orthogonal double covers of \(K_{n,n}\) by small graphs. ⋮ Orthogonal double covers of general graphs. ⋮ Coding Theory Motivated by Relational Databases ⋮ Design type problems motivated by database theory

Cites Work

• Minimum matrix representation of closure operations
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Optimal packings of \(K_4\)'s into a \(K_n\)
• Biplanes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions