更改

The<math>r(H)</math> of a hypergraph <math>H</math> is the maximum cardinality of any of the edges in the hypergraph.  If all edges have the same cardinality ''k'', the hypergraph is said to be ''uniform'' or ''k-uniform'', or is called a ''k-hypergraph''.  A graph is just a 2-uniform hypergraph.

The<math>r(H)</math> of a hypergraph <math>H</math> is the maximum cardinality of any of the edges in the hypergraph.  If all edges have the same cardinality ''k'', the hypergraph is said to be ''uniform'' or ''k-uniform'', or is called a ''k-hypergraph''.  A graph is just a 2-uniform hypergraph.

超图<math>H</math>的<math>r(H)</math>表示该超图中任何一条边的最大基数。如果所有边具有相同的基数''k''，则称该超图为均匀的或k-均匀的，或称之为k-超图。图只是一个2-均匀的超图。

超图<math>H</math>的<math>r(H)</math>表示该超图中任何一条边的最大'''基数'''。如果所有边具有相同的基数''k''，则称该超图为均匀的或k-均匀的，或称之为k-超图。图只是一个2-均匀的超图。

The degree ''d(v)'' of a vertex ''v'' is the number of edges that contain it. ''H'' is ''k-regular'' if every vertex has degree ''k''.

The degree ''d(v)'' of a vertex ''v'' is the number of edges that contain it. ''H'' is ''k-regular'' if every vertex has degree ''k''.

顶点''v''的度''d(v)''表示包含该顶点的边的数量。如果每个顶点的度都为''k''，则超图''H''是k-正则的。

'''顶点'''''v''的'''度'''''d(v)''表示包含该顶点的边的数量。如果每个顶点的度都为''k''，则超图''H''是'''k-正则'''的。

The dual of a uniform hypergraph is regular and vice versa.

The dual of a uniform hypergraph is regular and vice versa.