On the decomposition ofkn into complete bipartite graphs

Cited in

(51)

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

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)