Sciweavers

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

101

Voted

ARSCOM
2004

64views more ARSCOM 2004»

An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, 3, 3)

15 years 2 months ago

An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, 3, 3)

Download www.public.iastate.edu

Susan E. Fettes, Richard L. Kramer, Stanislaw P. R

Real-time Traffic

ARSCOM 2004 |

claim paper

Related Content

» New Lower Bounds for Some Multicolored Ramsey Numbers

» A note on Ramsey numbers with two parameters

» Online Ramsey games for triangles in random graphs

» Pathkipas Ramsey numbers

» Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs

» Properly EdgeColoured Subgraphs in Colourings of Bounded Degree

» On the number of line tangents to four triangles in threedimensional space

» Large kSeparated Matchings of Random Regular Graphs

» Extremal problems on triangle areas in two and three dimensions

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2004
Where	ARSCOM
Authors	Susan E. Fettes, Richard L. Kramer, Stanislaw P. Radziszowski

Comments (0)