On the decomposition ofkn into complete bipartite graphs

Cited In (51)

Complete bipartite decompositions of crowns, with applications to complete directed graphs
Covering complete \(r\)-graphs with spanning complete \(r\)-partite \(r\)-graphs
On biclique decompositions of complete \(t\)-partite graphs
An overview of graph covering and partitioning
On the decomposition of random hypergraphs
A short proof of Fisher's inequality
Computation of the biclique partition number for graphs with specific blocks
A counterexample to the Alon-Saks-Seymour conjecture and related problems
Clique versus independent set
On decompositions of complete hypergraphs
Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
A generalization of Fisher's inequality
Decompositions of complete multigraphs related to Hadamard matrices
Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
A tree whose complement is not eigensharp
On the decomposition of graphs into complete bipartite graphs
Decomposing the complete \(r\)-graph
Improved bounds for the Graham-Pollak problem for hypergraphs
Eigenvalues and clique partitions of graphs
Decomposition of the complete r-graph into complete r-partite r-graphs
Finding biclique partitions of co-chordal graphs
Decomposition of random graphs into complete bipartite graphs
More on the bipartite decomposition of random graphs
Clique partitions of the cocktail party graph
Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs
Bipartite decomposition of random graphs
Eigenvalues of complete multipartite graphs
On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs
Characterizing the flow equivalent trees of a network
Bounds for the Graham-Pollak theorem for hypergraphs
Biclique covers and partitions
Multicolored forests in bipartite decompositions of graphs
A new proof of a theorem of Graham and Pollak
\(G\)-designs and related designs
A critical probability for biclique partition of \(G_{n,p}\)
No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\)
On 2-colored graphs and partitions of boxes
Exact values and improved bounds on \(k\)-neighborly families of boxes
Decompositions of some regular graphs into unicyclic graphs of order five
A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes
Problems and invariants connected with bicliques and multicliques of graphs
Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
Helge Tverberg is eighty: a personal tribute
Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes
On biclique partitions of the complete graph
Proof of a conjecture of Frankl and Füredi
A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
Multicovering hypergraphs
A polynomial space proof of the Graham-Pollak theorem
Decomposition of product graphs into complete bipartite subgraphs
Subsets of a finite set that almost always intersect each other in \(\lambda\) elements

This page was built for publication: On the decomposition ofkn into complete bipartite graphs

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