Large cliques in hypergraphs with forbidden substructures (Q2226629)

A previous result from \textit{A. Gyárfás} et al. [Combinatorica 22, No. 2, 269--274 (2002; Zbl 0996.05094)] established a bound on the number of vertices in a complete subgraph that exists in a graph that does not contain a given induced subgraph with specified number of edges. The author suggests a new proof of this result that can be extended to \(k\)-uniform hypergraphs. The applications of the result related to the colorful and fractional versions of Helly's theorem are presented.