solidot新版网站常见问题,请点击这里查看。

Almost Complete Graphs and the Kruskal Katona Theorem. (arXiv:1810.05704v1 [math.CO])

来源于:arXiv
We consider the effect of subtracting edges from complete graphs on the "tightness' of the Kruskal-Katona upper bounds for the numbers of complete subgraphs. 查看全文>>