A Ramsey type result for oriented trees

DOI10.1016/J.EJC.2016.08.010zbMATH Open1348.05132OpenAlexW2520601202MaRDI QIDQ338566FDOQ338566

Authors: 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

Recommendations

• scientific article; zbMATH DE number 881276
• On generalized Ramsey numbers for trees
• Monochromatic trees in random tournaments

zbMATH Keywords

tournaments

Mathematics Subject Classification ID

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

Cites Work

• A Ramsey-type problem in directed and bipartite graphs
• Nombre chromatique et plus longs chemins d'un graphe
• Title not available (Why is that?)
• Zur algebraischen Begründung der Graphentheorie. I
• 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 proof of Sumner's universal tournament conjecture for large tournaments
• Title not available (Why is that?)
• Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
• Title not available (Why is that?)
• Trees in tournaments

Cited In (5)

• Title not available (Why is that?)
• Ramsey-nice families of graphs
• Monochromatic trees in random tournaments
• On heterochromatic out-directed spanning trees in tournaments
• On the unavoidability of oriented trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338566)