On multicolour noncomplete Ramsey graphs of star graphs

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Given graphs G, G1, ..., Gk, where k ≥ 2, the notation G → (G1, G2, ..., Gk) denotes that every factorization F1 ⊕ F2 ⊕ ⋯ ⊕ Fk of G implies Gi ⊆ Fi for at least one i, 1 ≤ i ≤ k. We characterize G for which G → (K (1, n1), K (1, n2), ..., K (1, nk)) and derive some consequences from this. In particular, this gives the value of the graph Ramsey number R (K (1, n1), K (1, n2), ..., K (1, nk)). © 2007 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Gautam, S., Srivastava, A. K., & Tripathi, A. (2008). On multicolour noncomplete Ramsey graphs of star graphs. Discrete Applied Mathematics, 156(12), 2423–2428. https://doi.org/10.1016/j.dam.2007.10.020

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free