4 papers
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…
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…
A Method for Constructing Minimally Unsatisfiable CNFs
Robert Cowen
We generalize a method of Ivor Spence (J. of Experimental Algorithms 15(March 2010)) that produces unsatisfiable cnfs and show experimentally that, for the most part, the resulting…
On a generalization of property B
Robert Cowen
A set-theoretic property called Property S is introduced as a generalization of the well-known Property B. Property S is named for A.Schrijver who first used it to formulate an equ…