Sciweavers

15 search results - page 1 / 3
» Ramsey numbers of sparse hypergraphs
Sort
View
ENDM
2007
62views more  ENDM 2007»
13 years 4 months ago
Ramsey numbers of sparse hypergraphs
Daniela Kühn, Oliver Cooley, Nikolaos Fountou...
JCT
2008
92views more  JCT 2008»
13 years 4 months ago
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Chv
Oliver Cooley, Nikolaos Fountoulakis, Daniela K&uu...
JCT
2011
115views more  JCT 2011»
12 years 11 months ago
Sharp thresholds for hypergraph regressive Ramsey numbers
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...
Lorenzo Carlucci, Gyesik Lee, Andreas Weiermann
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 8 days ago
Approximate Counting of Matchings in Sparse Hypergraphs
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
JCT
2006
69views more  JCT 2006»
13 years 4 months ago
The Ramsey number for hypergraph cycles I
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojt...