547 search results - page 65 / 110 » dm 2008 |
110
Voted
DM
2008
15 years 27 days ago
2008
We first give a bijective proof of Gould's identity in the model of binary words. Then we deduce Rothe's identity from Gould's identity again by a bijection, which a...
101
Voted
DM
2008
15 years 27 days ago
2008
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We ans...
98
Voted
DM
2008
15 years 27 days ago
2008
Let G be the set that contains precisely the graphs on n vertices with maximum degree 3 for which there exists a 4-cycle system of their complement in Kn. In this paper G is compl...
71
Voted
DM
2008
15 years 27 days ago
2008
Let p1, p2,..., pn be a sequence of n pairwise coprime positive integers, and let P = p1p2...pn. Let 0, 1, ...,m - 1 be a sequence of m different colors. Let A be an n
126
Voted
DM
2008
15 years 27 days ago
2008
We determine the number of alternating parity sequences that are subsequences of an increasing m-tuple of integers. For this and other related counting problems we find formulas th...