A Ramsey-type problem for paths in digraphs

DOI10.1007/BF01431439zbMath0239.05119OpenAlexW2094363710MaRDI QIDQ2553446

James E. Williamson

Publication date: 1973

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/162432

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ The Ramsey numbers r(P\(_m\),K\(_n\)) ⋮ Directed Ramsey number for trees ⋮ Nombres de Ramsey dans le cas oriente ⋮ Ramsey Graphs and Block Designs. I ⋮ Monochromatic trees in random tournaments ⋮ Some Ramsey nu mbers for directed graphs

Cites Work

• Some graph theoretic results associated with Ramsey's theorem
• Unnamed Item

This page was built for publication: A Ramsey-type problem for paths in digraphs