For any two graphs G and H, there exists a least positive integer R(G;H), such that every graph say F of order R(G;H) satisfies the following condition: either F contains G as a subgraph or the complement of F contains H. This book studies the determination of Ramsey number for a combination of path P_n and a wheel-like graph. What we mean by wheel-like graph, is a graph obtained from a wheel by a graph operation such as deletion or subdivision of the spoke edges. The classes of wheel-like graphs which we consider are Jahangir graph, generalized Jahangir graph and beaded wheel. Это и многое другое вы найдете в книге On Ramsey numbers (KASHIF ALI)
On Ramsey numbers KASHIF ALI (книга)
Подробная информация о книге «On Ramsey numbers KASHIF ALI». Сайт не предоставляет возможности читать онлайн или скачать бесплатно книгу «On Ramsey numbers KASHIF ALI»
