324 citations · 1.7k across the 753 of their papers we have counts for
11 papers · 1 filter
Iterated Ramsey bounds for the Hales-Jewett numbers
Mohammad Golshani, Saharon Shelah
Consider the Hales-Jewett theorem. The -dimensional version of it tells us that the combinatorial space has, under suitable assumpti…
On finitary Hindman's numbers
Shahram Mohsenipour, Saharon Shelah
Spencer asked whether the Paris-Harrington version of the Folkman-Sanders theorem has primitive recursive upper bounds. We give a positive answer to this question.
Universal graphs with a forbidden subgraph: Block path solidity
Gregory Cherlin, Saharon Shelah
Let C be a finite connected graph for which there is a countable universal C-free graph, and whose tree of blocks is a path. Then the blocks of C are complete. This generalizes a r…
What majority decisions are possible with possible abstaining
Paul Larson, Nick Matteo, Saharon Shelah
Suppose we are given a family of choice functions on pairs from a given finite set. The set is considered as a set of alternatives (say candidates for an office) and the functions…
What majority decisions are possible
Saharon Shelah
Suppose we are given a family of choice functions on pairs from a given finite set (with at least three elements) closed under permutations of the given set. The set is considered…
What majority decisions are possible
Saharon Shelah
The main result is the following: Let X be a finite set and D be a non empty family of choice functions for (X choose 2) closed under permutation of X. Then the following condition…