On the Ramsey number of sparse 3-graphs (Q1015430)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5552208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Ramsey number of sparse 3-graphs |
scientific article; zbMATH DE number 5552208 |
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
0.8730117678642273
0 references
0.8627138137817383
0 references
0.8625827431678772
0 references
0.851181149482727
0 references
0.8470937013626099
0 references
