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

DOI10.1016/0097-3165(88)90001-5MaRDI QIDQ1106468zbMATH OpenOpenAlexFDO

Authors 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

Bagemihl's conjecturedecomposition of graphsnearly-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)

Review text

Two d-polyhedra in \(E^ d\) are nearly-neighborly if they are separated by a hyperplane which contains a facet of each. The main result is: there can be at most 15 mutually nearly-neighborly tetrahedra in \(E^ 3\). There is a glossary of results on nearly-neighborly (and neighborly) sets of polyhedra, several conjectures, relevant results on decomposition of certain graphs. The paper ends with the following ``Note added in proof. Using a similar yet more detailed approach, S. Furino, B. Gamble and J. Zako (sic) proved that there can be at most 14 nearly-neighborly tetrahedra in \(E^ 3\).

Recommendations

• No nine neighborly tetrahedra exist
• Two neighborly families of 3-pyramids and of 3-boxes in \(E^{3}\)
• No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\)
• Putting convex \(d\)-polytopes inside frames
• Nearly neighbourly families of standard boxes

Cites work

• A Conjecture Concerning Neighboring Tetrahedra
• Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
• Bounds of neighborly families of convex polytopes
• Decomposition of product graphs into complete bipartite subgraphs
• scientific article; zbMATH DE number 3888434 (Why is no real title available?)
• scientific article; zbMATH DE number 3986073 (Why is no real title available?)
• scientific article; zbMATH DE number 3205160 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3271295 (Why is no real title available?)
• Neighborly families of \(2^ k\) k-simplices in \(E^ k\).
• No nine neighborly tetrahedra exist
• On Crum's Problem
• On the Addressing Problem for Loop Switching
• On the decomposition ofkn into complete bipartite graphs

Cited in

(10)

• Addressing graph products and distance-regular graphs
• No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\)
• Nearly neighbourly families of standard boxes
• Putting convex \(d\)-polytopes inside frames
• No nine neighborly tetrahedra exist
• Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs
• scientific article; zbMATH DE number 970791 (Why is no real title available?)
• On a problem of Zaks
• Binary stretch embedding of weighted graphs
• Bounds on the cardinalities of families of nearly neighborly quadrilaterals

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

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