36781 search results - page 37 / 7357 » Parameterizing by the Number of Numbers |
COMBINATORICS
2007
13 years 7 months ago
2007
It is shown that the (diagonal) size Ramsey numbers of complete m-partite graphs Km(n) can be bounded from below by cn22(m−1)n, where c is a positive constant. Key words: Size R...
COMBINATORICS
2000
13 years 7 months ago
2000
We give new lower bounds for the Schur numbers S(6) and S(7). This will imply new lower bounds for the Multicolor Ramsey Numbers R6(3) and R7(3). We also make several observations...
DM
1998
13 years 7 months ago
1998
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any...
JC
2010
13 years 6 months ago
2010
In this paper we de ne a new condition number adapted to directionally uniform perturbations in a general framework of maps between Riemannian manifolds. The de nitions and theorem...
MCS
2010
Springer
14 years 2 months ago
2010
Springer
One of the challenges in unsupervised machine learning is finding the number of clusters in a dataset. Clustering Validity Indices (CVI) are popular tools used to address this pro...