数学
组合数学
二部图
上下界
单色
色阶
离散数学
班级(哲学)
图形
数学分析
计算机科学
物理
光学
人工智能
出处
期刊:Combinatorics, Probability & Computing
[Cambridge University Press]
日期:2023-04-25
卷期号:32 (5): 703-723
被引量:1
标识
DOI:10.1017/s0963548323000093
摘要
Abstract 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$ .
科研通智能强力驱动
Strongly Powered by AbleSci AI