scientific article; zbMATH DE number 426159

zbMATH Open0790.05064MaRDI QIDQ3136986FDOQ3136986

Authors:

Publication date: 7 November 1993

Title of this publication is not available (Why is that?)

Recommendations

• On biclique partitions of the complete graph
• Minimal clique partitions and pairwise balanced designs
• Decompositions of complete multigraphs derived from Hadamard matrices
• scientific article; zbMATH DE number 4053683
• Regarding two conjectures on clique and biclique partitions

zbMATH Keywords

biclique partitionsaffine designscomplete multigraphbalanced weighing matricesbalanced bipartite designsbipartite analogue of difference sets

Mathematics Subject Classification ID

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

Cited In (13)

• On biclique decompositions of complete \(t\)-partite graphs
• Decompositions of complete multigraphs derived from Hadamard matrices
• Decompositions of complete multigraphs related to Hadamard matrices
• Regarding two conjectures on clique and biclique partitions
• Minimal clique partitions and pairwise balanced designs
• Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs
• Exact solutions to the Erdős-Rothschild problem
• Bipartite edge partitions and the former Alon-Saks-Seymour conjecture
• Some new bounds for cover-free families through biclique covers
• On biclique partitions of the complete graph
• Multicovering hypergraphs
• Partition of \(C_4\)-designs into minimum and maximum number of \(P_3\)-designs
• Inertia and biclique decompositions of joins of graphs

This page was built for publication:

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