2095 search results - page 60 / 419 » Improved pebbling bounds |
LATA
2009
Springer
14 years 4 months ago
2009
Springer
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymp...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of fini...
COMBINATORICS
2006
13 years 10 months ago
2006
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S Rd such that every angle determined by three points in S is acute, considerin...
JSC
2010
13 years 8 months ago
2010
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk , assuming that P is p...
LION
2009
Springer
14 years 4 months ago
2009
Springer
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...