Definitions
from Wiktionary, Creative Commons Attribution/ShareAlike License
 n. A generalization of a graph, in which edges can connect any number of vertices.
Etymologies
Examples

However, Cutkosky was able to provide an alternate method of detecting primes for a hypergraph in any dimension, relying on different structures than those used in the twodimensional theorem.

In this lecture, we use topological dynamics methods to prove some other Ramseytype theorems, and more specifically the polynomial van der Waerden theorem, the hypergraph Ramsey theo ...

 uniform hypergraph and you want a monochromatic complete subhypergraph with one has the usual finite Ramsey theorem for graphs, and although getting good asymptotics for is a major open problem in combinatorics, at least the general type of function is known: the growth is exponential in the general type of the function is no longer known.
Comments
Log in or sign up to get involved in the conversation. It's quick and easy.