共查询到20条相似文献,搜索用时 718 毫秒
1.
2.
3.
4.
5.
6.
Elena Rubei 《Discrete Mathematics》2012,312(19):2872-2880
7.
8.
9.
《Discrete Mathematics》2006,306(10-11):886-904
10.
11.
12.
《Discrete Mathematics》2007,307(17-18):2217-2225
13.
14.
Partitioning a set into similar, if not, identical, parts is a fundamental research topic in combinatorics. The question of partitioning the integers in various ways has been considered throughout history. Given a set of integers where , let the gap sequence of this set be the unordered multiset . This paper addresses the following question, which was explicitly asked by Nakamigawa: can the set of integers be partitioned into sets with the same gap sequence? The question is known to be true for any set where the gap sequence has length at most two. This paper provides evidence that the question is true when the gap sequence has length three. Namely, we prove that given positive integers and , there is a positive integer such that for all , the set of integers can be partitioned into 4-sets with gap sequence , . 相似文献
15.
16.
17.
We say a graph is -colorable with of ’s and of ’s if may be partitioned into independent sets and sets whose induced graphs have maximum degree at most . The maximum average degree, , of a graph is the maximum average degree over all subgraphs of . In this note, for nonnegative integers , we show that if , then is -colorable. 相似文献
18.
19.