论文部分内容阅读
For a hypergraph H,let δ1(H)denote the minimum number of edges of H containing a given vertex,and υ(H)denote the maximum size of a matching in H.