Ramsey numbers for transitive tournaments
Let \(D_1\) and \(D_2\) denote acyclic digraphs and let \(\rho(D_1,D_2)\) denote the least integer \(n\) such that every 2-colouring of the edges of the transitive tournament with \(n\) nodes contains a monochromatic \(D_i\) for some \(i\). The authors determine the value of \(\rho(D_1,D_2)\) for certain digraphs \(D_1\) and \(D_2\).
scientific article; zbMATH DE number 1340369