Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(2)
ramsey number
Regularization Method
Related Publications
(1)
Linear Ramsey Numbers for BoundedDegree Hypergrahps
Subscribe
Academic
Publications
Ramsey numbers of sparse hypergraphs
Ramsey numbers of sparse hypergraphs,10.1002/rsa.20260,Random Structures and Algorithms,David Conlon,Jacob Fox,Benny Sudakov
Edit
Ramsey numbers of sparse hypergraphs
(
Citations: 6
)
BibTex

RIS

RefWorks
Download
David Conlon
,
Jacob Fox
,
Benny Sudakov
We give a short proof that any kuniform hypergraph H on n vertices with bounded degree � has
Ramsey number
at most c(�, k)n, for an appropriate constant c(�, k). This result was recently proved by several authors, but those proofs are all based on applications of the hypergraph regularity method. Here we give a much simpler, selfcontained proof which uses new techniques developed recently by the authors together with an argument of Kostochka and Rodl. Moreover, our method demonstrates that, for k ≥ 4, c(�, k) ≤ 22 . . .2 c�
Journal:
Random Structures and Algorithms  RSA
, vol. 35, no. 1, pp. 114, 2009
DOI:
10.1002/rsa.20260
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
doi.wiley.com
)
(
arxiv.org
)
(
www.informatik.unitrier.de
)
Citation Context
(3)
...Indeed, in [
6
], we found a 3uniform hypergraph Cn on n vertices which is much sparser than the complete hypergraph K (3) n and whose fourcolor Ramsey number satisfies r(Cn;4) > 2 2...
David Conlon
,
et al.
Hypergraph Ramsey numbers
...has maximum degree at most �. After this manuscript was submitted, Conlon, Fox and Sudakov [
4
] obtained a proof of Theorem 1 which does not rely on hypergraph regularity and gives a better bound on C. Also, Ishigami [16] independently announced a proof of Theorem 1 using a similar approach to ours...
Oliver Cooley
,
et al.
Embeddings and Ramsey numbers of sparse kappauniform hypergraphs
...Indeed, in [
3
], the author, together with Fox and Sudakov, has shown that there are 3uniform hypergraphs on n vertices whose density tends to zero as n gets large but whose 4colour Ramsey number is at least 22...
David Conlon
.
The Ramsey number of dense graphs
References
(24)
Tura'n Numbers of Bipartite Graphs and Related RamseyType Questions
(
Citations: 38
)
Noga Alon
,
Michael Krivelevich
,
Benny Sudakov
Journal:
Combinatorics, Probability & Computing  CPC
, vol. 12, no. 56, pp. 477494, 2003
Ramsey numbers for sparse graphs
(
Citations: 16
)
Nancy Eaton
Journal:
Discrete Mathematics  DM
, vol. 185, no. 13, pp. 6375, 1998
On Ramsey Numbers of Sparse Graphs
(
Citations: 21
)
Alexandr V. Kostochka
,
Benny Sudakov
Journal:
Combinatorics, Probability & Computing  CPC
, vol. 12, no. 56, pp. 627641, 2003
A few remarks on RamseyTura'ntype problems
(
Citations: 14
)
Benny Sudakov
Journal:
Journal of Combinatorial Theory  JCT
, vol. 88, no. 1, pp. 99106, 2003
Large Krfree subgraphs in Ksfree graphs and some other Ramseytype problems
(
Citations: 14
)
Benny Sudakov
Journal:
Random Structures and Algorithms  RSA
, vol. 26, no. 3, pp. 253265, 2005
Sort by:
Citations
(6)
Hypergraph Ramsey numbers
(
Citations: 2
)
David Conlon
,
Jacob Fox
,
Benny Sudakov
Journal:
Journal of The American Mathematical Society  J AMER MATH SOC
, vol. 23, no. 1, pp. 247266, 2010
On two problems in graph Ramsey theory
(
Citations: 3
)
David Conlon
,
Jacob Fox
,
Benny Sudakov
Published in 2010.
A hypergraph blowup lemma
(
Citations: 1
)
Peter Keevash
Published in 2010.
Embedding large subgraphs into dense graphs
(
Citations: 17
)
Daniela Kühn
,
Deryk Osthus
Published in 2009.
Embeddings and Ramsey numbers of sparse kappauniform hypergraphs
(
Citations: 7
)
Oliver Cooley
,
Nikolaos Fountoulakis
,
Daniela Kühn
,
Deryk Osthus
Journal:
Combinatorica
, vol. 29, no. 3, pp. 263297, 2009