On Ramsey - Turán type theorems for hypergraphs


Let H’ be an r-uniform hypergraph. Let g=g(n; F) be the minimal integer so that any r-uniform hypergraph on n vertices and more than g edges contains a subgraph isomorphic to H’. Let e=f(n; H’, en) denote the minimal integer such that every r-uniform hypergraph on n vertices with more than e edges and with no independent set of .sn vertices contains a… (More)
DOI: 10.1007/BF02579235


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics