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

DOI10.2307/2323163MaRDI QIDQ3710552zbMATH OpenOpenAlexFDO

Authors 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

complete graphfactorizationscomplete 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)

Recommendations

• Cube factorizations of complete graphs
• scientific article; zbMATH DE number 1744099
• Complete bipartite factorisations of \(K _{n,n}\)
• Note on cyclic decompositions of complete bipartite graphs into cubes
• scientific article; zbMATH DE number 1228806

Cited in

(10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3710552)