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

Joseph Zaks

doi:10.1016/0097-3165(88)90001-5

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

Joseph Zaks

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

A family of d-polyhedra in E^d is called nearly-neighborly if every two members are separated by a hyperplane which contains facets of both of them. Reducing the known upper bound by 1, we prove that there can be at most 15 members in a nearly-neighborly family of tetrahedra in E³. The proof uses the following statement: "If the graph, obtained from K₁₆ by duplicating the edges of a 1-factor, is decomposed into t complete bipartite graphs, then t ≥ 9." Similar results are derived for various graphs and multigraphs.

Original language	English
Pages (from-to)	147-155
Number of pages	9
Journal	Journal of Combinatorial Theory. Series A
Volume	48
Issue number	2
DOIs	https://doi.org/10.1016/0097-3165(88)90001-5
State	Published - Jul 1988

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0097-3165(88)90001-5

Cite this

@article{bb0bc441a8654bbeb2f33c4647655a10,

title = "Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs",

abstract = "A family of d-polyhedra in Ed is called nearly-neighborly if every two members are separated by a hyperplane which contains facets of both of them. Reducing the known upper bound by 1, we prove that there can be at most 15 members in a nearly-neighborly family of tetrahedra in E3. The proof uses the following statement: {"}If the graph, obtained from K16 by duplicating the edges of a 1-factor, is decomposed into t complete bipartite graphs, then t ≥ 9.{"} Similar results are derived for various graphs and multigraphs.",

author = "Joseph Zaks",

year = "1988",

month = jul,

doi = "10.1016/0097-3165(88)90001-5",

language = "English",

volume = "48",

pages = "147--155",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

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

AU - Zaks, Joseph

PY - 1988/7

Y1 - 1988/7

N2 - A family of d-polyhedra in Ed is called nearly-neighborly if every two members are separated by a hyperplane which contains facets of both of them. Reducing the known upper bound by 1, we prove that there can be at most 15 members in a nearly-neighborly family of tetrahedra in E3. The proof uses the following statement: "If the graph, obtained from K16 by duplicating the edges of a 1-factor, is decomposed into t complete bipartite graphs, then t ≥ 9." Similar results are derived for various graphs and multigraphs.

AB - A family of d-polyhedra in Ed is called nearly-neighborly if every two members are separated by a hyperplane which contains facets of both of them. Reducing the known upper bound by 1, we prove that there can be at most 15 members in a nearly-neighborly family of tetrahedra in E3. The proof uses the following statement: "If the graph, obtained from K16 by duplicating the edges of a 1-factor, is decomposed into t complete bipartite graphs, then t ≥ 9." Similar results are derived for various graphs and multigraphs.

UR - https://www.scopus.com/pages/publications/38249028145

U2 - 10.1016/0097-3165(88)90001-5

DO - 10.1016/0097-3165(88)90001-5

M3 - Article

AN - SCOPUS:38249028145

SN - 0097-3165

VL - 48

SP - 147

EP - 155

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 2

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this