Advanced search
Start date
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)


Full text
Barros, Gabriel Ferreira [1] ; Cavalar, Bruno Pasqualotto [2] ; Kohayakawa, Yoshiharu [1] ; Naia, Tassio [1]
Total Authors: 4
[1] Univ Sao Paulo, Inst Matemat & Estat, Sao Paulo - Brazil
[2] Univ Warwick, Dept Comp Sci, Coventry CV4 7AL, W Midlands - England
Total Affiliations: 2
Document type: Journal article
Source: SIAM JOURNAL ON DISCRETE MATHEMATICS; v. 35, n. 4, p. 2844-2857, 2021.
Web of Science Citations: 0

If G is a graph and H is an oriented graph, we write G -> H to say that every orientation of the edges of G contains (H) over right arrow as a subdigraph. We consider the case in which G is the binomial random graph G(n, p), establishing the threshold p((H) over right arrow) = p((H) over right arrow) (n) for the property G(n, p) -> (H) over right arrow for the cases in which (H) over right arrow is an acyclic orientation of a complete graph or of a cycle. (AU)

FAPESP's process: 19/13364-7 - Extremal and Structural Problems in Graph Theory
Grantee:Cristina Gomes Fernandes
Support type: Regular Research Grants
FAPESP's process: 18/05557-7 - Computational complexity and extremal combinatorics
Grantee:Bruno Pasqualotto Cavalar
Support type: Scholarships in Brazil - Master
FAPESP's process: 18/04876-1 - Ramsey theory, structural graph theory and applications in Bioinformatics
Grantee:Guilherme Oliveira Mota
Support type: Research Grants - Young Investigators Grants