| Full text | |
| Author(s): |
Campos, Marcelo
;
Collares, Mauricio
;
Mota, Guilherme Oliveira
Total Authors: 3
|
| Document type: | Journal article |
| Source: | RANDOM STRUCTURES & ALGORITHMS; v. 64, n. 3, p. 16-pg., 2023-11-07. |
| Abstract | |
For every k >= 3, we determine the order of growth, up to polylogarithmic factors, of the number of orientations of the binomial random graph containing no directed cycle of length k. This solves a conjecture of Kohayakawa, Morris and the last two authors. (AU) | |
| FAPESP's process: | 19/13364-7 - Extremal and structural problems in graph theory |
| Grantee: | Cristina Gomes Fernandes |
| Support Opportunities: | Regular Research Grants |
| 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 |