On K1,k-factorizations of a complete bipartite graph
β Scribed by Hong Wang
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 311 KB
- Volume
- 126
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
We present a necessary condition for a complete bipartite graph K,., to be K,.,-factorizable and a sufficient condition for K,,, to have a K,,,-factorization whenever k is a prime number. These two conditions provide Ushio's necessary and sufficient condition for K,,, to have a K,,,-factorization.
Theorem 1.1. Let k( > l), m and n be positive integers. If K,,. has a KI,k-factorization then m< kn, n< km, kn-mrkm-n-O(mod(k2-1)) and (kn-m)(km-n)=O (modk(k'-l)(m+n)).
π SIMILAR VOLUMES
Let k be an odd integer /> 3, and G be a connected graph of odd order n with n/>4k -3, and minimum degree at least k. In this paper it is proved that if for each pair of nonadjacent vertices u, v in G max{dG(u), d~(v)} >~n/2, then G has an almost k--factor F + and a matching M such that F-and M are
## Abstract We consider __k__βfactorizations of the complete graph that are 1β__rotational__ under an assigned group __G__, namely that admit __G__ as an automorphism group acting sharply transitively on all but one vertex. After proving that the __k__βfactors of such a factorization are pairwise i
## Abstract We consider 2βfactorizations of complete graphs that possess an automorphism group fixing __k__β©Ύ0 vertices and acting sharply transitively on the others. We study the structures of such factorizations and consider the cases in which the group is either abelian or dihedral in some more d