A Ramsey type result for oriented trees

DOI10.1016/j.ejc.2016.08.010zbMath1348.05132OpenAlexW2520601202MaRDI QIDQ338566

Raphael Yuster

Publication date: 7 November 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2016.08.010

zbMATH Keywords

tournaments

Mathematics Subject Classification ID

Trees (05C05) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Ramsey-nice families of graphs ⋮ Directed Ramsey number for trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some Ramsey nu mbers for directed graphs
• Paths with two blocks in \(k\)-chromatic digraphs
• Oriented trees in digraphs
• Monochromatic paths in edge-colored graphs
• A Ramsey-type problem in directed and bipartite graphs
• A proof of Sumner's universal tournament conjecture for large tournaments
• Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
• Nombre chromatique et plus longs chemins d'un graphe
• Zur algebraischen Begründung der Graphentheorie. I
• Trees in tournaments

This page was built for publication: A Ramsey type result for oriented trees