Cycle systems in the complete bipartite graph plus a one-factor
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n+I denote Kn,n with a one-factor added. It is proved in this paper that there exists an m-cycle system of Kn,n + I if and only if n ≡ 1 (mod 2), m ≡ 0 (mod 2), 4 ≤ m ≤ 2n, and n(n...
Saved in:
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/93927 http://hdl.handle.net/10220/7629 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| id |
sg-ntu-dr.10356-93927 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.10356-939272023-02-28T19:36:49Z Cycle systems in the complete bipartite graph plus a one-factor Ling, San Ma, Jun Pu, Liqun Shen, Hao School of Physical and Mathematical Sciences DRNTU::Science::Mathematics Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n+I denote Kn,n with a one-factor added. It is proved in this paper that there exists an m-cycle system of Kn,n + I if and only if n ≡ 1 (mod 2), m ≡ 0 (mod 2), 4 ≤ m ≤ 2n, and n(n + 1) ≡ 0 (mod m). Published version 2012-03-09T03:48:19Z 2019-12-06T18:47:55Z 2012-03-09T03:48:19Z 2019-12-06T18:47:55Z 2008 2008 Journal Article Pu, L., Shen, H., Ma, J., & Ling, S. (2008). Cycle systems in the complete bipartite graph plus a one-factor. SIAM Journal of discrete math, 21(4), 1083–1092. https://hdl.handle.net/10356/93927 http://hdl.handle.net/10220/7629 10.1137/06065461X en SIAM Journal of discrete math ©2008 Society for Industrial and Applied Mathematics This paper was published in SIAM J Discrete Math and is made available as an electronic reprint (preprint) with permission of Society for Industrial and Applied Mathematics.The paper can be found at http://dx.doi.org/10.1137/06065461X. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law. 10 p. application/pdf |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
NTU Library |
| collection |
DR-NTU |
| language |
English |
| topic |
DRNTU::Science::Mathematics |
| spellingShingle |
DRNTU::Science::Mathematics Ling, San Ma, Jun Pu, Liqun Shen, Hao Cycle systems in the complete bipartite graph plus a one-factor |
| description |
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n+I denote Kn,n with a one-factor added. It is proved in this paper that there exists an m-cycle
system of Kn,n + I if and only if n ≡ 1 (mod 2), m ≡ 0 (mod 2), 4 ≤ m ≤ 2n, and n(n + 1) ≡ 0 (mod m). |
| author2 |
School of Physical and Mathematical Sciences |
| author_facet |
School of Physical and Mathematical Sciences Ling, San Ma, Jun Pu, Liqun Shen, Hao |
| format |
Article |
| author |
Ling, San Ma, Jun Pu, Liqun Shen, Hao |
| author_sort |
Ling, San |
| title |
Cycle systems in the complete bipartite graph plus a one-factor |
| title_short |
Cycle systems in the complete bipartite graph plus a one-factor |
| title_full |
Cycle systems in the complete bipartite graph plus a one-factor |
| title_fullStr |
Cycle systems in the complete bipartite graph plus a one-factor |
| title_full_unstemmed |
Cycle systems in the complete bipartite graph plus a one-factor |
| title_sort |
cycle systems in the complete bipartite graph plus a one-factor |
| publishDate |
2012 |
| url |
https://hdl.handle.net/10356/93927 http://hdl.handle.net/10220/7629 |
| _version_ |
1759857407928827904 |