We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
For a fixed infinite graph 
$H$, we study the largest density of a monochromatic subgraph isomorphic to 
$H$ that can be found in every two-colouring of the edges of 
$K_{\mathbb{N}}$. This is called the Ramsey upper density of 
$H$ and was introduced by Erdős and Galvin in a restricted setting, and by DeBiasio and McKenney in general. Recently [4], the Ramsey upper density of the infinite path was determined. Here, we find the value of this density for all locally finite graphs 
$H$ up to a factor of 2, answering a question of DeBiasio and McKenney. We also find the exact density for a wide class of bipartite graphs, including all locally finite forests. Our approach relates this problem to the solution of an optimisation problem for continuous functions. We show that, under certain conditions, the density depends only on the chromatic number of 
$H$, the number of components of 
$H$ and the expansion ratio 
$|N(I)|/|I|$ of the independent sets of 
$H$.
