For a set X of vertices of a graph fulfilling local connectedness conditions the existence of a cycle containing X is proved. AMS classification: 05C38, 05C45, 05C35
In this paper we study the sequence (ci)0id for a distance-regular graph. In particular we show that if d 2j and cj = c > 1 then c2j > c holds. Using this we give improveme...
Let A be a 2p-element set, p prime, and let be a fixed point-free permutation on A of order p. We study the interval of clones C on A such that C consists of functions that are s...
In this note we analyze the linearized equations of forced elongation. We prove that solutions of these equations are given by a quasicontraction C0-semigroup on the physically co...