Ramsey upper density of infinite graph factors-Reference-Cited by-同舟云学术

Ramsey upper density of infinite graph factors

Published:2023-04-01 Issue:1 Volume:67 Page:
ISSN:0019-2082
Container-title:Illinois Journal of Mathematics
language:
Short-container-title:Illinois J. Math.

Author:

Balogh József¹,Lamaison Ander²

Affiliation:

1. Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA; and Moscow Institute of Physics and Technology, Russian Federation

2. Faculty of Informatics, Masaryk University, Brno, Czech Republic . Previous affiliation: Freie Universität Berlin, Berlin, Germany

Publisher

Duke University Press

Subject

General Mathematics

Reference9 articles.

1. S. A. Burr, P. Erdős, and J. H. Spencer, Ramsey theorems for multiple copies of graphs, Trans. Amer. Math. Soc. 209 (1975).

2. J. Corsten, L. DeBiasio, A. Lamaison, and R. Lang, Upper density of monochromatic infinite paths, Adv. Comb. (2019), Paper No. 4, 16.

3. J. Corsten, L. DeBiasio, and P. McKenney, Density of monochromatic infinite subgraphs ii, https://arxiv.org/abs/2007.14277 (2020).

4. L. DeBiasio and P. McKenney, Density of monochromatic infinite subgraphs, Combinatorica 39 (2019), no. 4, 847–878.

5. M. Elekes, D. T. Soukup, L. Soukup, and Z. Szentmiklóssy, Decompositions of edge-colored infinite complete graphs into monochromatic paths, Discrete Math. 340 (2017), no. 8, 2053–2069.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs;European Journal of Combinatorics;2023-05