Nombres de ramsey dans le cas orienté |
| |
Authors: | A Benhocine |
| |
Institution: | Cité d'' Orléans, Bt C2, Setif, Algerie |
| |
Abstract: | Given two directed graphs G1, G2, the Ramsey number R(G1,G2) is the smallest integer n such that for any partition {U1,U2} of the arcs of the complete symmetric directed graph K1n, there exists an integer i such that the partial graph generated by Ui contains Gi as a subgraph. In this article, we determine R(P?m,D?n) and R(D?m,D?n) for some values of m and n, where P?m denotes the directed path having m vertices and D?m is obtained from P?m by adding an arc from the initial vertex of P?m to the terminal vertex. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|