15 citations · 57 across the 12 of their papers we have counts for
Showing 2003Show all
3 papers · 1 filter
math.CO2003
On unavoidable sets of word patterns
Alexander Burstein, Sergey Kitaev
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets o…
math.CO2003★ 5 cited
Independent sets in certain classes of (almost) regular graphs
Alexander Burstein, Sergey Kitaev, Toufik Mansour
We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between the…
math.CO2003
The problem of the pawns
S. Kitaev, T. Mansour
In this paper we study the number of ways to place nonattacking pawns on an chessboard. We find an upper bound for and analyse its asymptotic behavi…