ConceptTheory & Algos
Hypergraph Ramsey number
The minimum number of vertices required in a p-uniform hypergraph to guarantee the existence of a monochromatic m-clique for any c-coloring of its edges.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.