Description:
Definitions from Cowen [1990] for forms [14 BD] through [14 BG].
Content:
Definitions from Cowen [1990] for forms [14 BD] through [14 BG].
A hypergraph is a pair \(H=\langle V,E\rangle\) where \(V\) is a set (of vertices) and \(E\) is a set of non-empty finite subsets of \(V\). \(E\) is called the set of edges. \(H\) is finite if \(V\) is finite. \(K=\langle W,F \rangle\) is a subhypergraph of \(H =\langle V,E \rangle\) if \(W\subseteq V\) and \(F \subseteq E\). \(W\subseteq V\) is independent in \(H=\langle V,E \rangle\) if no two elements of \(W\) belong to the same edge of \(H\). \(W \subseteq V\) is a vertex cover of \(H=\langle V,E \rangle\) if each element of E contains at least one element of \(W\). An \(n\)-coloring of \(H=\langle V,E\rangle\) is a function \(f:V \to \{0,1,\ldots,n-1\}\) such that \(|f''e| > 1\) for all \(e\in E\) with \(|e| > 1\).
Howard-Rubin number: 117
Type: Definitions
Back