Some Ramsey nu mbers for directed graphs
From MaRDI portal
Publication:1846431
DOI10.1016/0012-365X(74)90077-6zbMath0288.05111OpenAlexW2013142454MaRDI QIDQ1846431
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(74)90077-6
Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)
Related Items (9)
Ramsey numbers for degree monotone paths ⋮ A Ramsey type result for oriented trees ⋮ On a problem of Erdős and Rado ⋮ New bounds on the Ramsey number \(r ( I_m , L_n )\) ⋮ Ramsey numbers for tournaments ⋮ Directed Ramsey number for trees ⋮ Nombres de Ramsey dans le cas oriente ⋮ Monochromatic trees in random tournaments ⋮ Idiosynchromatic poetry
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Ramsey numbers r(P\(_m\),K\(_n\))
- Monochromatic paths in edge-colored graphs
- A Ramsey-type problem for paths in digraphs
- The Voting Problem
- Nombre chromatique et plus longs chemins d'un graphe
- Some graph theoretic results associated with Ramsey's theorem
- Disproof of a conjecture of Erdös and moser on tournaments
This page was built for publication: Some Ramsey nu mbers for directed graphs