Let be the three-uniform hypergraph with three of the four possible edges on four vertices. Every -free three-uniform hypergraph on vertices has an independent set of size at leastEquivalently, .
Articles by others on the same topic
There are currently no matching articles.