Bucić, M;
Letzter, S;
Sudakov, B;
(2019)
3‐Color bipartite Ramsey number of cycles and paths.
Journal of Graph Theory
, 92
(4)
pp. 445-459.
10.1002/jgt.22463.
Preview |
Text
bip-path-ramsey.pdf - Accepted Version Download (349kB) | Preview |
Abstract
The k-colour bipartite Ramsey number of a bipartite graph H is the least integer n for which every k-edge-coloured complete bipartite graph Kn,n contains a monochromatic copy of H. The study of bipartite Ramsey numbers was initiated, over 40 years ago, by Faudree and Schelp and, independently, by Gy´arf´as and Lehel, who determined the 2-colour Ramsey number of paths. In this paper we determine asymptotically the 3-colour bipartite Ramsey number of paths and (even) cycles.
| Type: | Article |
|---|---|
| Title: | 3‐Color bipartite Ramsey number of cycles and paths |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1002/jgt.22463 |
| Publisher version: | https://doi.org/10.1002/jgt.22463 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions. |
| Keywords: | bipartite Ramsey number, path Ramsey number, cycle Ramsey number, connected matchings |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Mathematics |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10107269 |
Archive Staff Only
 |
View Item |
