212 search results - page 2 / 43 » On Lengths of Rainbow Cycles |
COMBINATORICS
2006
14 years 11 months ago
2006
The set of cycle lengths of almost all permutations in Sn are "Poisson distributed": we show that this remains true even when we restrict the number of cycles in the per...
102
click to vote
GC
2008
Springer
14 years 11 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
GC
2002
Springer
14 years 11 months ago
2002
Springer
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
HICSS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper aims at exploring the role of the product generation life cycle (PGLC) on differences in innovation strategy among industries in a crossindustry study of ten multinatio...
JGT
2010
14 years 6 months ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...