Generalized Ramsey Theory for Graphs V. the Ramsey Number of a Digraph
From MaRDI portal
Publication:4775886
DOI10.1112/blms/6.2.175zbMath0288.05110OpenAlexW2091090248MaRDI QIDQ4775886
Publication date: 1974
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/blms/6.2.175
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (5)
On a problem of Erdős and Rado ⋮ Directed Ramsey number for trees ⋮ Nombres de Ramsey dans le cas oriente ⋮ Weighted graphs defining facets: A connection between stable set and linear ordering polytopes ⋮ Monochromatic trees in random tournaments
This page was built for publication: Generalized Ramsey Theory for Graphs V. the Ramsey Number of a Digraph
