𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a problem of J. Csima

✍ Scribed by Liang Sun

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
88 KB
Volume
87
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

A problem of J. Csima on the factorization of regular bipartite graphs is settled.

Let G be a k-regular bipartite graph with bipartition (X, Y). We say that G is a k-spread if IN(S)] 3 ]SI + k -1 for every S c X satisfying 1 s IS] s 1x1k + 1, where N(S) denotes the neighborhood of S. Note that a connected. Csima [l] posed the following conjecture.

πŸ“œ SIMILAR VOLUMES

On a Problem by J. M. Wills
On a Problem by J. M. Wills
✍ Peter Sauer πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 173 KB

## Abstract Let __P__~1~(__n__), __P__~2~(__n__), __P__~3~(__n__) denote the norm‐polyhedra cube, crosspolytope and sphere in the Euclidean __n__‐space. We consider the polyhedra __D__~__i,j__~(__n__):=__P__~__i__~(__n__)∩__P__~__j__~(__n__) with 1 ≦ __i__ β‰  __j__ ≦ 3. In [2] posed the question abo

On a problem raised by P.J. Cameron
On a problem raised by P.J. Cameron
✍ Richard P. Lewis; Simon P. Norton πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 139 KB

At the problem session of the 14th British Combinatorial Conference, Cameron asked for a bijection between the set of permutations of { 1,2 ..... nl. with all cycles of even length and the set of permutations of { 1, 2 ..... n} with all cycles odd (where n is even). Here we give bijections between m

On a Problem of Zaks
On a Problem of Zaks
✍ Alan J. Hoffman πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 86 KB

Let M m be a matching with m edges, n 2m. We prove that the smallest number of complete bipartite graphs which partition the edges of K n +M m is at least n&m+w-2mx&1.