A Ramsey-style Problem on Hypergraphs

Construct hypergraphs as large as possible that do not have a certain easy-to-check, difficult-to-find property.

Read in full here: