Advanced search
Start date
Betweenand


DIRECTED GRAPHS WITH LOWER ORIENTATION RAMSEY THRESHOLDS

Full text
Author(s):
Barros, Gabriel Ferreira ; Cavalar, Bruno Pasqualotto ; Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Naia, Tassio
Total Authors: 5
Document type: Journal article
Source: RAIRO-OPERATIONS RESEARCH; v. 58, n. 4, p. 13-pg., 2024-09-09.
Abstract

We investigate the threshold p((H) over right arrow) = p((H) over right arrow)(n) for the Ramsey-type property G(n, p) -> (sic)H, where G(n, p) is the binomial random graph and G -> (H) over right arrow indicates that every orientation of the graph G contains the oriented graph (sic) H as a subdigraph. Similarly to the classical Ramsey setting, the upper bound p((H) over right arrow) <= Cn(-1/m2((H) over right arrow)) is known to hold for some constant C = C((H) over right arrow), where m(2)((H) over right arrow) denotes the maximum 2-density of the underlying graph H of (H) over right arrow. While this upper bound is indeed the threshold for some (H) over right arrow, this is not always the case. We obtain examples arising from rooted products of orientations of sparse graphs (such as forests, cycles and, more generally, subcubic {K-3, K-3,K-3}-free graphs) and arbitrarily rooted transitive triangles. (AU)

FAPESP's process: 18/05557-7 - Computational complexity and extremal combinatorics
Grantee:Bruno Pasqualotto Cavalar
Support Opportunities: Scholarships in Brazil - Master
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: 20/16570-4 - Problems in Ramsey Theory, random graphs and embeddings
Grantee:Tássio Naia dos Santos
Support Opportunities: Scholarships abroad - Research Internship - Post-doctor
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: 19/04375-5 - Problems in Ramsey Theory, random graphs and embeddings
Grantee:Tássio Naia dos Santos
Support Opportunities: Scholarships in Brazil - Post-Doctoral