Publications of (and about) Paul Erdös
Autor: Bollobás, Béla; Erdös, Paul; Jin, Guoping
Title: Strictly ascending pairs and waves. (In English)
Source: Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley, 83-95 (1995).
Review: The authors study the maximal length of a word subject to the restriction that the word contains no ascending sequence of k pairs. They also study the maximal length of a word if the restriction is that it contain no ascending wave of length h+1 in letter \alpha.
Reviewer: R.Stanton (Winnipeg)
Classif.: * 05A99 Classical combinatorial problems
68R15 Combinatorics on words
Keywords: word; ascending sequence; ascending wave
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag