Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs

DOI10.1002/jgt.3190100208zbMath0592.05030OpenAlexW2107820048MaRDI QIDQ3720624

Dan Pritikin

Publication date: 1986

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190100208

zbMATH Keywords

complete bipartite graphcomplete graphgraph decompositioncomplete directed graphcomplete directed bipartite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

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 ⋮ Decompositions of complete multigraphs derived from Hadamard matrices ⋮ Minimum matrix rank of k-regular (0,1) matrices ⋮ Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs ⋮ On biclique partitions of the complete graph ⋮ A short proof of Fisher's inequality ⋮ On biclique decompositions of complete \(t\)-partite graphs ⋮ Decompositions of complete multigraphs related to Hadamard matrices ⋮ Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices

Cites Work

• On the addressing problem for directed graphs
• Unnamed Item

This page was built for publication: Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs