On the decomposition ofkn into complete bipartite graphs
From MaRDI portal
Publication:3967567
DOI10.1002/jgt.3190060414zbMath0502.05048OpenAlexW1967237366MaRDI QIDQ3967567
Publication date: 1982
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190060414
Related Items
Clique partitions of the cocktail party graph ⋮ An overview of graph covering and partitioning ⋮ Subsets of a finite set that almost always intersect each other in \(\lambda\) elements ⋮ Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Proof of a conjecture of Frankl and Füredi ⋮ Helge Tverberg is eighty: a personal tribute ⋮ Decomposing the complete \(r\)-graph ⋮ A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes ⋮ Clique versus independent set ⋮ Biclique covers and partitions ⋮ Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes ⋮ On 2-colored graphs and partitions of boxes ⋮ Improved bounds for the Graham-Pollak problem for hypergraphs ⋮ More on the Bipartite Decomposition of Random Graphs ⋮ A polynomial space proof of the Graham-Pollak theorem ⋮ 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 ⋮ Eigenvalues of complete multipartite graphs ⋮ A counterexample to the Alon-Saks-Seymour conjecture and related problems ⋮ Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs ⋮ A tree whose complement is not eigensharp ⋮ Multicolored forests in bipartite decompositions of graphs ⋮ On the decomposition of random hypergraphs ⋮ On biclique partitions of the complete graph ⋮ A short proof of Fisher's inequality ⋮ Decomposition of Random Graphs into Complete Bipartite Graphs ⋮ Multicovering hypergraphs ⋮ A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph ⋮ Decompositions of some regular graphs into unicyclic graphs of order five ⋮ Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs ⋮ On the decomposition of graphs into complete bipartite graphs ⋮ On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs ⋮ Eigenvalues and clique partitions of graphs ⋮ \(G\)-designs and related designs ⋮ No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\) ⋮ On biclique decompositions of complete \(t\)-partite graphs ⋮ Characterizing the flow equivalent trees of a network ⋮ Decompositions of complete multigraphs related to Hadamard matrices ⋮ Decomposition of the complete r-graph into complete r-partite r-graphs ⋮ A generalization of Fisher's inequality ⋮ Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs ⋮ Bounds for the Graham-Pollak theorem for hypergraphs ⋮ On decompositions of complete hypergraphs ⋮ A new proof of a theorem of Graham and Pollak ⋮ Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices ⋮ Bipartite decomposition of random graphs ⋮ Decomposition of product graphs into complete bipartite subgraphs
