𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the decomposition of graphs into isomorphic matchings

✍ Scribed by N. Alon


Publisher
Akadmiai Kiad
Year
1983
Tongue
English
Weight
125 KB
Volume
42
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the Decomposition of Cayley Color Gra
✍ J.F. Fink πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 579 KB

We prove that if \(\Delta\) is a minimal generating set for a nontrivial group \(\Gamma\) and \(T\) is an oriented tree having \(|\Delta|\) edges, then the Cayley color graph \(D_{\Delta}(\Gamma)\) can be decomposed into \(|\Gamma|\) edge-disjoint subgraphs, each of which is isomorphic to \(T\); we

A note on the number of perfect matching
✍ Zhang Fuji; Zhang Heping πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 484 KB

Let G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perfect matchings. For plane bipartite graphs each interior face of which is surrounded by a circuit of length 4s + 2, s E { 1,2,. . .}, an elegant formula, i.e. det A = (-1 )nK2, had been rigorously proved by Cv

On the decomposition of n-cubes into iso
✍ John Frederick Fink πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 324 KB

## Abstract We prove that if T is any tree having __n__ edges (__n__ β‰₯ 1), then the __n__‐cube Q~n~ can be decomposed into 2^n‐1^ edge‐disjoint induced subgraphs, each of which is isomorphic to T. We use this statement to obtain two results concerning decompositions of Q~n~ into subgraphs isomorphi

On the decomposition of a graph into sta
✍ Michael Tarsi πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 248 KB

It is known that whenever u(u -1) -0 (mod 2m) and u ~=2tn, the complete graph K, can be decomposed into edge disjoint, m-stars [l, 21. In this paper we prove that K, can be