搜索结果: 1-1 共查到“图论 Densities”相关记录1条 . 查询时间(0.062 秒)
We de ne the limiting density of a minor-closed family of simple graphs F to be the smallest
number k such that every n-vertex graph in F has at most kn(1+o(1)) edges, and we investigate
the set of ...