Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs
From MaRDI portal
Publication:2700970
DOI10.1016/j.ejc.2022.103625OpenAlexW4323928389MaRDI QIDQ2700970
Publication date: 27 April 2023
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.08767
Cites Work
- Unnamed Item
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- Density of monochromatic infinite paths
- The Ramsey numbers for a triple of long cycles
- Density of monochromatic infinite subgraphs
- Monochromatic infinite paths
- Three-color Ramsey numbers for paths
- Stars versus stripes Ramsey numbers
- New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
- The Ramsey number for stripes
- Monochromatic Paths in Graphs
- Upper density of monochromatic infinite paths
This page was built for publication: Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs