4 citations · 22 across the 26 of their papers we have counts for
Showing 2012 · math.COShow all
3 papers · 2 filters
math.CO2012★ 1 cited
New Upper and Lower Bounds on the Rado Numbers
William Gasarch, Russel Moriarty, Nithin Tumma
If E is a linear homogenous equation and c a natural then the Rado number is the least N so that any c-coloring of the positive integers from 1 to N contains a monochromat…
math.CO2012★ 1 cited
Three Proofs of the Hypergraph Ramsey Theorem (An exposition)
William Gasarch, Andy Parrish, Sandow Sinai
Ramsey, Erdos-Rado, and Conlon-Fox-Sudakov have given proofs of the 3-hypergraph Ramsey Theorem with better and better upper bounds on the 3-hypergraph Ramsey Number. Ramsey and Er…
math.CO2012
A Statement in Combinatorics that is Independent of ZFC (an exposition)
Stephen Fenner, William Gasarch
It is known that, for any finite coloring of the naturals, there exists distinct naturals that are the same color such that . Consider the follow…