dx.doi.org/doi:10.3888/tmj.20-6 An important problem in graph theory is to find the number of complete subgraphs of a given size in a graph. If the graph is very large, it is usually only possible to obtain upper bounds for these numbers based on the numbers of complete subgraphs of smaller sizes. The Kruskal–Katona bounds are often … Continue reading Improving the Kruskal—Katona Bounds for Complete Subgraphs of a Graph