Structural and extremal properties of graphs and hypergraphs
Quasi-random hypergraphs and spanning subhypergraph containment
Ramsey and anti-Ramsey structures in deterministic and random graphs
| Full text | |
| Author(s): |
Barros, G. F.
;
Cavalar, B. P.
;
Mota, G. O.
;
Parczyk, O.
Total Authors: 4
|
| Document type: | Journal article |
| Source: | ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE; v. 346, p. 10-pg., 2019-08-30. |
| Abstract | |
For graphs G and H, let G rp -> p H denote the property that for every proper edge colouring of G there is a rainbow copy of H in G. Extending a result of Nenadov, Person, Skorie and Steger (2017), we prove that rt-1/"12(cr) is the threshold for G(n,p) rb -> pC(l) when l >= 5. Thus our result together with a result of the third author which says that the threshold for G rb -> pC(4), is n(-3/4) settles the problem of determining the threshold for C rb -> pC(l) for all values of l. (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: | 18/05557-7 - Computational complexity and extremal combinatorics |
| Grantee: | Bruno Pasqualotto Cavalar |
| Support Opportunities: | Scholarships in Brazil - Master |