12 citations · 34 across the 20 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2023★ 3 cited
On extremal factors of de Bruijn-like graphs
Nicolás Álvarez, Verónica Becher, Martín Mereb +2
In 1972 Mykkeltveit proved that the maximum number of vertex-disjoint cycles in the de Bruijn graphs of order is attained by the pure cycling register rule, as conjectured by G…
math.CO2021
On the number of words with restrictions on the number of symbols
Verónica Becher, Eda Cesaratto
We show that, in an alphabet of symbols, the number of words of length whose number of different symbols is away from , which is the value expected by the Poisson…
math.CO2016
Perfect Necklaces
Nicolás Álvarez, Verónica Becher, Pablo A. Ferrari +1
We introduce a variant of de Bruijn words that we call perfect necklaces. Fix a finite alphabet. Recall that a word is a finite sequence of symbols in the alphabet and a circular w…