Title of article
On a Problem of Zaks
Author/Authors
Hoffman، نويسنده , , Alan J.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
7
From page
371
To page
377
Abstract
Let Mm be a matching with m edges, n⩾2m. We prove that the smallest number of complete bipartite graphs which partition the edges of Kn+Mm is at least n−m+⌊2m⌋−1.
Keywords
honeymoon hotel , Complete bipartite graph , Zaks graph
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2001
Journal title
Journal of Combinatorial Theory Series A
Record number
1530560
Link To Document