15254 search results - page 121 / 3051 » A k |
185
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
114
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet k on k letters, an abelian squarefree word is max...
