Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
DOI10.1016/0097-3165(88)90001-5zbMATH Open0651.52003OpenAlexW2084210724MaRDI QIDQ1106468FDOQ1106468
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
Recommendations
Polytopes and polyhedra (52Bxx) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Convex sets in (3) dimensions (including convex surfaces) (52A15)
Cites Work
- On the Addressing Problem for Loop Switching
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds of neighborly families of convex polytopes
- On the decomposition ofkn into complete bipartite graphs
- Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of product graphs into complete bipartite subgraphs
- Neighborly families of \(2^ k\) k-simplices in \(E^ k\).
- A Conjecture Concerning Neighboring Tetrahedra
- On Crum's Problem
- No nine neighborly tetrahedra exist
Cited In (8)
- Addressing graph products and distance-regular graphs
- Putting convex \(d\)-polytopes inside frames
- Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs
- No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\)
- No nine neighborly tetrahedra exist
- Nearly neighbourly families of standard boxes
- On a problem of Zaks
- Title not available (Why is that?)
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)
