Erdős-Hajnal bound for the three-edge hypergraph on four vertices
ID: erdos-hajnal-bound-for-the-three-edge-hypergraph-on-four-vertices
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, .
New to topics? Read the docs here!