ECO method and hill-free generalized Motzkin paths.
ECO species.
Edge cover time for regular graphs.
Edit distance between unlabeled ordered trees
There exists a bijection between one-stack sortable permutations (permutations which avoid the pattern (231)) and rooted plane trees. We define an edit distance between permutations which is consistent with the standard edit distance between trees. This one-to-one correspondence yields a polynomial algorithm for the subpermutation problem for (231) pattern-avoiding permutations. Moreover, we obtain the generating function of the edit distance between ordered unlabeled trees and some special ones. For...
Efficient lower bounds on the number of repetition-free words.
Ein Extremalproblem für Gitterpunkte.
Eine Anwendung des Satzes über induzierte Morphismen in der Kombinatorik.
Eine gruppentheoretische Methode in der Musiktheorie
Eine Verallgemeinerung der Ungleichung vom arithmetischen und geometrischen Mittel.
El arte de contar.
Embeddings of 2-spheres in 4-manifolds.
Endliche 0-1-Folgen mit gleichen Teilblöcken.
Endliche Verbände.
Entropy due to fragmentation of dendrimers.
Enumerating Davenport-Schinzel sequences
Enumerating Kautz sequences
Enumerating pattern avoidance for affine permutations.
Enumerating permutations avoiding more than three Babson-Steingrímsson patterns.
Enumerating permutations that avoid three term arithmetic progressions.
Enumerating up-side self-avoiding walks on integer lattices.