Orientation Ramsey Thresholds for Cycles and Cliques

DOI10.1137/20M1386463zbMath1479.05348arXiv2012.08632OpenAlexW3214745248MaRDI QIDQ5013576

Bruno Pasqualotto Cavalar, Gabriel Ferreira Barros, Yoshiharu Kohayakawa, Tássio Naia

Publication date: 1 December 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.08632

zbMATH Keywords

random graphsRamseyorientationthreshold

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the KŁR conjecture in random graphs
• An approximate version of Sumner's universal tournament conjecture
• Claws contained in all \(n\)-tournaments
• Largest digraphs contained in all n-tournaments
• Threshold functions
• On claws belonging to every tournament
• On avoidable and unavoidable claws
• An algorithmic framework for obtaining lower bounds for random Ramsey problems
• Anti-Ramsey threshold of cycles
• Graph Theory
• A proof of Sumner's universal tournament conjecture for large tournaments
• The Voting Problem
• Paths and Cycles in Tournaments
• Ramsey properties of orientations of graphs
• On an anti‐Ramsey threshold for sparse graphs with one triangle
• Unavoidable trees in tournaments
• Monochromatic trees in random tournaments
• A Short Proof of the Random Ramsey Theorem
• Digraphs
• Trees in tournaments
• Directed Ramsey number for trees
• Trees in tournaments
• On the unavoidability of oriented trees
• Trees in tournaments