12 citations · 29 across the 10 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2020★ 3 cited
Density of monochromatic infinite subgraphs II
Jan Corsten, Louis DeBiasio, Paul McKenney
In 1967, Gerencsér and Gyárfás proved a result which is considered the starting point of graph-Ramsey theory: In every 2-coloring of there is a monochromatic path on $\lceil(…
math.CO2016
Density of monochromatic infinite subgraphs
Louis DeBiasio, Paul McKenney
For any countably infinite graph , Ramsey's theorem guarantees an infinite monochromatic copy of in any -coloring of the edges of the countably infinite complete graph $K…