Sciweavers

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

6

RSA
2010

favoriteEmaildiscussreport

89views more RSA 2010»

Ramsey properties of random discrete structures

13 years 2 months ago

Ramsey properties of random discrete structures

Download www.ma.huji.ac.il

We study thresholds for Ramsey properties of random discrete structures. In particular, we determine the threshold for Rado’s theorem for solutions of partition regular systems of equations in random subsets of the integers and we prove the 1-statement of the conjectured threshold for Ramsey’s theorem for random hypergraphs. Those results were conjectured by R¨odl and Ruci´nski and similar results were obtained independently by Conlon and Gowers.

Ehud Friedgut, Vojtech Rödl, Mathias Schacht

Real-time Traffic

Conjectured Threshold | Partition Regular Systems | Random Discrete Structures | RSA 2010 |

claim paper

Related Content

» A Note on the Testability of Ramseys Class

» Typical properties of winners and losers in discrete optimization

» Property Testing and Parameter Testing for Permutations

» Contextual Random Boolean Networks

» Logical and algorithmic properties of stable conditional independence

» Discrete mobile centers

» Analog Hardware Implementation of the Random Neural Network Model

» Continuous Conditional Random Fields for Regression in Remote Sensing

» Universal Asymptotics for Random Tries and PATRICIA Trees

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	RSA
Authors	Ehud Friedgut, Vojtech Rödl, Mathias Schacht

Comments (0)