258 search results - page 2 / 52 » New Lower Bounds for Heilbronn Numbers |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...
CP
2001
Springer
13 years 9 months ago
2001
Springer
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
COMBINATORICS
2000
13 years 4 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
2008
13 years 4 months ago
2008
We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for...