%A Lamaison, Ander
%D 2019
%T Ramsey upper density of infinite graphs
%K
%X Let H be an infinite graph. In a two-coloring of the edges of the complete graph on the natural numbers, what is the densest monochromatic subgraph isomorphic to H that we are guaranteed to find? We measure the density of a subgraph by the upper density of its vertex set. This question, in the particular case of the infinite path, was introduced by Erd ő s and Galvin. Following a recent result for the infinite path, we present bounds on the maximum density for other choices of H, including exact values for a wide class of bipartite graphs.
%U http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1194
%J Acta Mathematica Universitatis Comenianae
%0 Journal Article
%P 897-901%V 88
%N 3
%@ 0862-9544
%8 2019-07-30