On biclique partitions of the complete graph

DOI10.1016/0012-365X(93)90335-QzbMath0783.05082MaRDI QIDQ686164

Bryan L. Shader

Publication date: 1 November 1993

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

zbMATH Keywords

complete graphcomplete matchingbiclique partitions

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs ⋮ On biclique decompositions of complete \(t\)-partite graphs ⋮ The number of tournaments with the minimum number of upsets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new proof of a theorem of Graham and Pollak
• How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged?
• Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
• Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs
• On the decomposition ofkn into complete bipartite graphs
• On the tournament matrices with smallest rank
• On the Addressing Problem for Loop Switching

This page was built for publication: On biclique partitions of the complete graph