| Full text | |
| Author(s): |
Collares, Mauricio
;
Kohayakawa, Yoshiharu
;
Moreira, Carlos Gustavo
;
Mota, Guilherme Oliveira
;
Ferreira, CE
;
Lee, O
;
Miyazawa, FK
Total Authors: 7
|
| Document type: | Journal article |
| Source: | PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM; v. 195, p. 8-pg., 2021-01-01. |
| Abstract | |
Given graphs G, H-1 and H-2, let G (sic) (H-1, H-2) denote the property that in every edge -colouring of G there is a monochromatic copy of H-1 or a rainbow copy of H-2. The constrained Ramsey number, defined as the minimum n such that K-n (sic) (H-1, H-2), exists if and only if H-1 is a star or H-2 is a forest. We determine the threshold for the property G(n, p) (sic) (H-1, H-2) when H-2 is a forest. (C) 2021 The Authors. Published by Elsevier B.V. (AU) | |
| FAPESP's process: | 18/04876-1 - Ramsey theory, structural graph theory and applications in Bioinformatics |
| Grantee: | Guilherme Oliveira Mota |
| Support Opportunities: | Research Grants - Young Investigators Grants |
| FAPESP's process: | 19/13364-7 - Extremal and structural problems in graph theory |
| Grantee: | Cristina Gomes Fernandes |
| Support Opportunities: | Regular Research Grants |