A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A structural result for hypergraphs with many restricted edge colorings

2010
*
Journal of Combinatorics
*

In honor of Joel Spencer's 60+ birthday For k-uniform hypergraphs F and H and an integer r ≥ 2, let c r,F (H) denote the number of r-colorings of the set of hyperedges of H with no monochromatic copy of F and let c r,F (n) = max H∈Hn c r,F (H), where the maximum runs over the family H n of all k-uniform hypergraphs on n vertices. Moreover, let ex(n, F ) be the usual Turán function, i.e., the maximum number of hyperedges of an n-vertex k-uniform hypergraph which contains no copy of F . In this

doi:10.4310/joc.2010.v1.n4.a4
fatcat:s3lyjqrrvvcpxhgodol6fprpae