1 citations · 1 across the 4 of their papers we have counts for
6 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…
Adaptive Fault Diagnosis using Self-Referential Reasoning
Robert Cowen
The problem is to determine which processors are reliable in a remote location by asking "Yes or No" questions. The processors are of three types: those that always tell the truth,…
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…
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…