scientific article; zbMATH DE number 4008439
[For the entire collection see Zbl 0619.00006.] Let \(TT_ k\), \(P_ k\), and \(S_ k\) denote the transitive tournament on k vertices, the directed path with k edges and the directed outgoing star with k edges, respectively. Let \(D_ 1\) and \(D_ 2\) be two acyclic directed graphs. The number \(RT(D_ 1,D_ 2)\) will denote the smallest integer n satisfying the following property: If T is a tournament on n vertices whose edges are colored by red and blue, then T contains either a copy of \(D_ 1\) all of whose edge are red or a copy of \(D_ 2\) all of whose edges are blue. It is proved that \(RT(TT_ 3,TT_ 3)=14\), \(34\leq RT(TT_ 3,TT_ 4)\leq 42\) and the numbers \(RT(TT_{\ell},S_ k)\) and \(RT(TT_{\ell},P_ k)\) are evaluated for \(\ell =3,4\) and every k.
- On Ramsey-Turán type problems in tournaments
- Ramsey numbers for transitive tournaments
- Ordered and canonical Ramsey numbers of stars
- On 1-subdivisions of transitive tournaments
- Tighter bounds on directed Ramsey number \(R(7)\)
- A NOTE ON RAMSEY NUMBERS FOR FANS
- Ordered Ramsey numbers
- Ramsey numbers for tournaments
- Transitive subtournaments of k-th power Paley digraphs and improved lower bounds for Ramsey numbers
- A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758874)