✦ LIBER ✦

The homeomorphic embedding of Kn in the m-cube

✍ Scribed by Jehuda Hartman

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 345 KB
Volume: 16
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(76)90143-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lipschitz homeomorphisms of the Hilbert

Lipschitz homeomorphisms of the Hilbert cube

✍ Jussi Väisälä 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 867 KB

On ambient embeddings in the Hilbert cub

On ambient embeddings in the Hilbert cube

✍ David G. Wright 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Hamilton-connectivity and cycle-embeddin

Hamilton-connectivity and cycle-embedding of the Möbius cubes

✍ Jianxi Fan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 68 KB

The recently introduced interconnection network, the Möbius cube, is an important variant of the hypercube. This network has several attractive properties compared with the hypercube. In this paper, we show that the n-dimensional Möbius cube M n is Hamilton-connected when n 3. Then, by using the Ham

Embedding a differentiable homeomorphism

Embedding a differentiable homeomorphism in a flow subject to a regularity condition on the derivatives of the positive transition homeomorphisms

✍ Ping-Fun Lam 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 452 KB

The existence of homeomorphic subgraphs

The existence of homeomorphic subgraphs in chordal graphs

✍ C.R. Subramanian; C.E. Veni Madhavan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 458 KB

On the decomposition of Kn into complete

On the decomposition of Kn into complete m-partite graphs

✍ Qingxue Huang 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 1 views

## Abstract Graham and Pollak [3] proved that __n__ −1 is the minimum number of edge‐disjoint complete bipartite subgraphs into which the edges of __K__~__n__~ can be decomposed. Using a linear algebraic technique, Tverberg [2] gives a different proof of that result. We apply his technique to show