1 citations · 1 across the 3 of their papers we have counts for
3 papers
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
An additive version of Ramsey's theorem
Andy Parrish
We show that, for every , there is an so that any -coloring of the edges of the complete graph on will yield a monochromatic complete subgraph on vertic…
math.CO2012
Toward a graph version of Rado's theorem
Andy Parrish
An equation is called graph-regular if it always has monochromatic solutions under edge-colorings of the complete graph on the naturals. We present two Rado-like conditions which a…