Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

104

Voted

COMBINATORICS
2004

103views more COMBINATORICS 2004»

Constructive Lower Bounds on Classical Multicolor Ramsey Numbers

15 years 2 months ago

Constructive Lower Bounds on Classical Multicolor Ramsey Numbers

Download www.combinatorics.org

Xu Xiaodong, Xie Zheng, Geoffrey Exoo, Stanislaw P

Real-time Traffic

COMBINATORICS 2004 |

claim paper

Related Content

» New Lower Bound Formulas for Multicolored Ramsey Numbers

» Symmetric SumFree Partitions and Lower Bounds for Schur Numbers

» New Lower Bounds for Some Multicolored Ramsey Numbers

» Some New Ramsey Colorings

» Martins game a lower bound for the number of sets

» Satisfiability and Computing van der Waerden Numbers

» Extracting Randomness Using Few Independent Sources

» Noncommutative circuits and the sumofsquares problem

» Cost Bounds of Multicast LightTrees in WDM Networks

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	COMBINATORICS
Authors	Xu Xiaodong, Xie Zheng, Geoffrey Exoo, Stanislaw P. Radziszowski

Comments (0)