On Ramsey numbers of uniform hypergraphs with given maximum degree (Q855851)
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 5078233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Ramsey numbers of uniform hypergraphs with given maximum degree |
scientific article; zbMATH DE number 5078233 |
Statements
On Ramsey numbers of uniform hypergraphs with given maximum degree (English)
0 references
7 December 2006
0 references
Let \(H_1\) and \(H_2\) be \(r\)-uniform hypergraphs with \(m\) vertices and maximum degree at most \(\Delta\). It was shown for fixed \(r\) and \(\Delta\), that the Ramsey number \(R(H_1, H_2) \leq m ^{1 + o(1)}\). Stronger versions of this result were proved, where the upper bound on the degree \(\Delta\) is determined by appropriate subsets of \(H_1\) and \(H_2\). Also, Turán-type results for uniform multipartite hypergraphs are proved.
0 references
0 references
0.8854387402534485
0 references
0.85970538854599
0 references
0.8590571284294128
0 references
0.8582396507263184
0 references
0.8448582291603088
0 references