On the Ramsey number of sparse 3-graphs (Q1015430)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Ramsey number of sparse 3-graphs |
scientific article |
Statements
On the Ramsey number of sparse 3-graphs (English)
0 references
8 May 2009
0 references
It is shown that if \(F\) is a \(3\)-uniform hypergraph with maximum degree \(\Delta\) and order \(n\), then there is a constant \(C = C(\Delta)\) such that the Ramsey number \(R(F, F) \leq Cn\). This extends a result of \textit{V. Chvátal}, \textit{V. Rödl}, \textit{E. Szemerédi}, and \textit{W.T. Trotter} in [J. Comb. Theory, Ser. B 34, 239--243 (1983; Zbl 0547.05044)] that the Ramsey number for graphs of bounded degree is linear in the order of the graph.
0 references
Ramsey theory
0 references
Ramsey number
0 references
uniform hypergraphs
0 references
Burr-Erdős conjecture
0 references
