搜索结果: 1-1 共查到“数学 Covering numbers for graphs”相关记录1条 . 查询时间(0.047 秒)
The covering number of a hypergraph H is the largest integer k such that the edges of H can be partitioned into k classes such that every vertex is incident with edges from every class. We
prove a nu...