120 search results - page 1 / 24 » Some New Ramsey Colorings |
COMBINATORICS
1998
13 years 4 months ago
1998
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
EJC
2006
13 years 4 months ago
2006
1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
COMBINATORICS
1999
13 years 4 months ago
1999
In this article we use two different methods to find new lower bounds for some multicolored Ramsey numbers. In the first part we use the finite field method used by Greenwood and ...
DM
2007
13 years 4 months ago
2007
In this paper, we obtain some new results R(5, 12) 848, R(5, 14) 1461, etc., and we obtain new upper bound formulas for Ramsey numbers with parameters. © 2006 Published by Elsevi...