Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs

DOI10.1016/0097-3165(88)90001-5zbMath0651.52003OpenAlexW2084210724MaRDI QIDQ1106468

Joseph Zaks

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(88)90001-5

zbMATH Keywords

decomposition of graphsBagemihl's conjecturenearly-neighborly tetrahedra

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Convex sets in (3) dimensions (including convex surfaces) (52A15) Polytopes and polyhedra (52Bxx)

Related Items (6)

Putting convex \(d\)-polytopes inside frames ⋮ Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs ⋮ On a problem of Zaks ⋮ Addressing graph products and distance-regular graphs ⋮ Nearly neighbourly families of standard boxes ⋮ No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\)

Cites Work

• Decomposition of product graphs into complete bipartite subgraphs
• Bounds of neighborly families of convex polytopes
• Neighborly families of \(2^ k\) k-simplices in \(E^ k\).
• No nine neighborly tetrahedra exist
• A Conjecture Concerning Neighboring Tetrahedra
• Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
• On the decomposition ofkn into complete bipartite graphs
• On the Addressing Problem for Loop Switching
• On Crum's Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs