Let H = (V, E) be a hypergraph, and let F be a field. A function f : V → F is called stable if for each e ϵ E, the sum of the values of f on the members of e is the same. The linear space consisting of the stable functions, denoted by U(H, F), is called the uniformity space of H over F. The dimension of U(H, F), denoted by udim(H,F), is called the uniformity dimension of H over F. The concept of uniformity space carries over to several (weighted) (hyper)graph-theoretic problems, in which we require that all the sub(hyper)graphs with a specific property have the same weight or size. This is done by defining an appropriate hypergraph whose edges represent all the sub(hyper)graphs having this property. Two such natural problems are:
- •
• Let G1 = (V1, E1) and G2 = (V2, E2) be two graphs where G1 is a subgraph of G2. A function f : E2 → F is called stable if all the copies of G1 and G2 have the same weight.
- •
• Let G = (V, E) be a graph. A function f : V → F is called stable if all the maximal (w.r.t. containment) independent sets of G have the same weight.
Clearly, many other problems can be formulated, and their resulting uniformity space can be defined. The purpose of this paper is twofold. The first is to determine (or, alternatively, compute efficiently) the uniformity dimension, and a corresponding basis, of several problems. The other purpose is to show applications of the uniformity space concept to other graph-theoretic problems, such as the determination of the zero-sum mod 2 Ramsey numbers.
