Sciweavers

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

7

ENDM
2007

favoriteEmaildiscussreport

62views more ENDM 2007»

Ramsey numbers of sparse hypergraphs

13 years 4 months ago

Ramsey numbers of sparse hypergraphs

Download www.math.ucla.edu

Daniela Kühn, Oliver Cooley, Nikolaos Fountou

Real-time Traffic

ENDM 2007 |

claim paper

Related Content

» 3Uniform hypergraphs of bounded degree have linear Ramsey numbers

» Sharp thresholds for hypergraph regressive Ramsey numbers

» Approximate Counting of Matchings in Sparse Hypergraphs

» The Ramsey number for hypergraph cycles I

» On the Ramsey Number of Sparse 3Graphs

» Extractors for a constant number of polynomially small minentropy independent sources

» Counting Connected Graphs and Hypergraphs via the Probabilistic Method

» On the Scalability of Hypergraph Models for Sparse Matrix Partitioning

» Extracting Randomness Using Few Independent Sources

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ENDM
Authors	Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus

Comments (0)