On the decomposition ofkn into complete bipartite graphs

Cited in

(54)

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

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)