212 search results - page 10 / 43 » On Lengths of Rainbow Cycles |
COMBINATORICS
2007
13 years 9 months ago
2007
The known bijections on Dyck paths are either involutions or have notoriously intractable cycle structure. Here we present a size-preserving bijection on Dyck paths whose cycle st...
DM
1998
13 years 9 months ago
1998
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
ICRA
1998
IEEE
14 years 1 months ago
1998
IEEE
In this paper we address the problem of energyoptimal gait generation for biped robots. Using a simpli ed robot dynamics that ignores the e ects of centripetal forces, we obtain u...
COMBINATORICS
2004
13 years 9 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...