On Ramsey numbers of uniform hypergraphs with given maximum degree

摘要

For every is an element of > 0 and every positive integers Delta and r, there exists C = C(is an element of, Delta, r) such that the Ramsey number, R(H, H) of any r-uniform hypergraph H with maximum degree at most Delta is at most C vertical bar V(H)vertical bar(1+is an element of). (c) 2006 Elsevier Inc. All rights reserved.