1 citations · 1 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2018
The Kruskal-Katona Theorem for Graphs
Robert Cowen
In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper…
math.CO2018
More Cases Where the Kruskal-Katona Bound is Tight
Robert Cowen
In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper…
math.CO2013★ 1 cited
Deleting Edges from Ramsey Minimal Examples
Robert Cowen
If r(s, t) = p, we shall call Kp a Ramsey Minimal Example. We prove that if r{s,t) = p, and one edge is deleted from the Ramsey Minimal Example, Kp, the resulting graph no longer h…