How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged?

DOI10.2307/2323163zbMath0585.05026OpenAlexW4246651142MaRDI QIDQ3710552

Joseph Zaks

Publication date: 1985

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2323163

zbMATH Keywords

factorizationscomplete graphcomplete bipartite graphsneighborly familiestranslations of the d-cube

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

Maximal equilateral sets ⋮ Putting convex \(d\)-polytopes inside frames ⋮ New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\) ⋮ Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes ⋮ Decompositions of complete multigraphs derived from Hadamard matrices ⋮ On the biclique cover of the complete graph ⋮ Cube tiling and covering a complete graph ⋮ On biclique partitions of the complete graph ⋮ Nearly neighbourly families of standard boxes ⋮ On biclique decompositions of complete \(t\)-partite graphs

This page was built for publication: How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged?